[10 pts] The following are the state diagrams of two DFAs, M1 and M2. Answer the following questions about each of these machines: a. [1 pts] What is the start state? b. [3 pts] What is the set of accept states? c. [1 pts] What sequence of states does the machine go through on input aabb? d. [1 pts] Does the machine accept the string aabb? e. [1 pts] Does the machine accept the string ? f. [2 pts] Give the formal description of the machines M1 and M2