Q1. Let M be the NFA with transition function: 93 - final 95 State Transition on 0 90 - start {91.95} 91 - final {90,92} {92, 93} {91, 94} 0 {94} {93,95} {93} {91,94} Convert the above NFA to an equivalent DFA by following these steps 1. Compute the e-closure set for each of the states of the NFA. 2. The e-closure of the start state of the NFA will be the start state of the DFA. 3. Track the transitions for {0,1} for this state. Take the e-closure of the result. This may be a new state of the DFA. 4. Repeat Step 3 until no more new states are being added and all transitions are accounted for. 5. Mark the final states. Q2. Using the methods described in class, produce an NFA that is equivalent to the following regular expressions Do not simplify the NFA. 1. ab