0 q0 q1 1. (10 points) Consider the NFA M: (a) According to Theorem 1.45, the NFA, N, that would result from the general algorithm for proving that L(M)UL(M) is regular is given by the state diagram: q1 q2 g0 43 Draw the computation of N on the input 001 (it should be a tree of runs, like that on page 49). Explain why L(N) L(M) (b) For a DFA, switching accept / non-accept states gives a machine that recognizes the complement of the language of the original machine. Does 0 q0 ql recognize L(M)? Why or why not? in the book to convert M to a DFA and then to a regular expression. Include enough work to justify your