1. DFAs

Create the state diagram for a DFA which recognizes the following languages.

Assume = {0, 1} :

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

b) L = {w| every odd position of the string is a one} Assume the first character read has place one

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