In this assignment, you will implement a deterministic finite automaton (DFA) using C++ programming language to test if

[answerhappygod]

In this assignment, you will implement a deterministic finiteautomaton (DFA) using C++ programming language to test if an inputDNA sequence matches a regular expression.
The program should mimic how a DFA processes a string: readingone letter at a time and doing state transitions. Pleasesee Week 3 materials on DFA implementation in BlackBoard forreference.
Below are four sample input/output. Only the bolded strings areuser inputs.
Input a DNA sequence: AATT
The pattern AATT is valid
Input a DNA sequence: AATATTAAAA
The pattern AATATTAAAA is not valid
Input a DNA sequence: AAAAAAA
The pattern AAAAAAA is valid
Input a DNA sequence: AATTTTAAAA
The pattern AATTTTAAAA is valid