3) The following are the state diagrams of two DFAs, M1 and M2. Answer the following questions about each of these machines: 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 ? 4) Give the formal description of the machines M1 and M2 pictured in Exercise 3. 4) The formal description of a DFA M is ( {q1,q2,q3,q4,q5},{u,d},,q3,{q3} ), where is given by the following table. Give the state diagram of this machine