Lecture 8: Finite State Automata 5. [3 points] Take the regular expression of Problem 1 (a's and b's with an even number of a's or an even number of b's), and design two DFAs that each solve half the problem (one DFA should check for even number of a's and don't care parity of b's, and the other should check for an even number of b's and don't care parity of a's). Then build an NFA that at start, simply does e-transitions to the start states of the two DFAs. Write out a description of the NFA using either a state transition table or diagram (your choice)