Create the state diagram for a DFA which recognizes the following languages. Assume 9 = {0,1} : a) L = {w\w has an odd number of ones and exactly two zeroes} (15 points) b) L = {w| every even position of the string is a zero} Assume the first character read has position 1. (10 points) c) Give the formal definition 5-tuple of the DFA from part b). (5 points)