(2) Consider the following NFA N for this question and the next: Start-( 1 2 7 Convert N into a DFA M such that L(M) L(N) using the algorithm from the text and lecture notes. You must expressly use the algorithm and you must show the scratchwork used to derive your answer. Then use your DFA to help answer the following four questions: a) Can N process the string baa to any one of its four states? Trace out a computation of the DFA showing yes or no. (b) Is there a string y such that N does not accept the string baa-y? Again, demonstrate your answer using M and traces. (c) Is there a string z that N cannot process? (d) If the start state of N had been state 3 not state 1, then would the DFA have a dead state