Given the NFA M = ({q0, q1, q2}, {0, 1}, , q0, {q2}), where is defined by:

State 0 1

q0 {q1} {q0}

q1 {q1, q2} {q0, q2}

q2

(a) Draw the NFA using JFLAP, call the file HW3-2-nfa.jff.

(b) Using the algorithm in the textbook, convert the NFA to a DFA. Name the states using superstate names. You can leave the qs out for brevity. So instead of q1q2 you can simply use 12. Draw the DFA using JFLAP. It is perfectly fine to compare the nfa and your dfa for equivalence using JFLAP. But be sure to create the DFA by hand, not using JFLAPs convert