Create the state diagram for a DFA which recognizes the following languages. Assume = {0, 1} :

a) L = {w|w has an odd number of ones and exactly two zeroes}

b) L = {w| every even position of the string is a zero} Assume the first character read has position 1.

c) Give the formal definition 5-tuple of the DFA from part b).