(Answered): need help with question 2 and 3 1. The following are the state diagrams of two DFAs, M1 and M2. Answ ...

1. The following are the state diagrams of two DFAs, M1 and M2. Answer the follow- ing questions about each of these machines. b a a 91 92 91 a 42 a b a,b 93 93 a 94 a M M2 a. What is the start state? b. What is the set of accept states? c. What sequence of states does the machine go through on input aabb? d. Does the machine accept the string aabb? e. Does the machine accept the string e? 2. Give a formal description of the above two DFAs by specifying the 5-tuple. 3. Construct a Deterministic Finite Automata accepting each of the following: 2.1{w e {a, b}": w has abab as a substring} 2.2{w {a, b}":w has neither aa nor bb as a substring}