1. (a) Construct a state diagram for a deterministic finite automaton (DFA) M over the alphabet = {0, 1} such that the language of M is L(M) = {01}. Note: there is no comma here, so L(M)is a singleton set. DRAW (b) Use your answer from part (a) to construct a state diagram for a nondeterministic finite automa-ton (NFA) N over such that L(N) = {01}. Construct N as we did in lecture, by retaining allthe states from M and adding one new start state. DRAW (c) Find a two-state NFA N such that L(N) = {01}. (You may start from scratch.)