This question tests your understanding of the equivalence between DFAs and NFAs. Consider NFA M = ({q1, q2}, {a, b}, , q1, {q1}) for defined as:

	0	1	2
q0	{q0,q1}	{q1}
q1		{q0,q1}	{q1}

(a) Draw the state diagrams for M.

(b) Based on the construction of Theorem 1.39 in the text, start to build the DFA M0 that is equivalent to M by identifying the number of DFA states and listing them.

(c) Identify the DFA M0 starting and acceptance states.

(d) Draw the state diagram for the DFA M0 equivalent to M