1) Define DFA and NFA , explain the differences between them with an example. 2) Provide an NFA for the following language L={w|w contains an even number of 0’s or exactly two 1’s} 3) Construct a NFA accepting ab,ba and use it to find a DFA accepting same set. 4) draw the transition diagram for the FA M={(A,B,C,D),(0,1),δ,c,(A,C)} δ(A,0)=,δ(A,1)={A,B,C) δ(B,0)=B, δ(B,1)={A,C} δ(C,0)={B,C},δ(C,1)={B,D} δ(D,0)={A,B,C,D} δ(D,1)={A} 5) For the following state transition table, draw state transition diagram find its equivalent DFA machine for string abbaaab , check whether both give same result or not. State 0 1 ->q0 {q1} {q2} q1 {q1} {q3} q2 *q3 {q0 q3} {q3} 6) Explain the procedure to convert NFA to DFA with any example 7) Explain the procedure to convert NFA with epsilon to NFA without epsilon with any example. .