Homework1 Due September 20 1. Consider the state diagrams for two DFAs, M1 and M2 x, y 42 43 42 M1 M2 a. Give the formal descriptions of the two machines above- specifically, specify the elements of the 5-tuple (Q,2, .qo. F)AFor each machine Q ??, -? ? , -??, b. What sequence of states does the machine go through on input yyyx c. Are there an infinite number of strings accepted by the machine? d. Does the machine accept the string xxyyxx? 2.The formal description of a DFA M3 is (lg..g..q.gu,g 0.11.6.a