(a) Define a deterministic finite state automaton (as a state transition diagram) for each of the following languages over the alphabet E = {0, 1}:
L = {x | every even position of x is a 1}
L = {x | x contains at least one 0}
(b) Define an NFA (as a state transition diagram) that accepts L^2. You must use the construction discussed in class.
(c) Define an NFA (as a state transition diagram) that accepts L. You must use the construction discussed in class.
(d) Define a DFA (as a state transition diagram) that accepts L^2. You must use the construction discussed in class.