q0 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)U L(M) is regular is given by the state diagram: q1 q2 g0 q4 - 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 g0 q1 recognize L(M Why or why not? (c) Compute a regular expression describing L(M). You can use your earlier work or use the Theorems in the book to convert M to a DFA and then to a regular expression. Include enough work to justify your