Q1. Let M be the NFA with transition function: 193 State Transition on 0 1 90 - Start {91,98} {90) {92) 91 - final {90,92} {92, 93} 93 - final 0 ( 90) {u} 0 (9) 95 {0.6s) {a} {0.00) 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. Q1. Let M be the NFA with transition function: 193 State Transition on 0 1 90 - Start {91,98} {90) {92) 91 - final {90,92} {92, 93} 93 - final 0 ( 90) {u} 0 (9) 95 {0.6s) {a} {0.00) 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