1) Formal Descriptions of DFA's: a) Give the formal description (i.e. the 5-tuple) for the following machine. Be sure to include the 8 table. (5 points) b) Give the language that this machine accepts, i.e. L(M). (5 points) 1 0 90 q1 q2 1 = 2) For each of the following construct a DFA for the indicated language. Please turn in the state diagram for it. Assume ? {0,1}. (5 points each). a) {wlw does not contain the substring 001} b) {wlw begins with a 0 and ends with a 1} c) {wlw is exactly of length 4} d) {wlevery even position of w is 0} e) {0101, 111, 00, 0}