Given the following NFA: N = (Q, , , q0, {q4J) where qo is the starting state, {g, } is the set of final (accepting) states (one state), Qo q1, 2, 43, q43, 1, 2, 3) and the 6-transition summary table is: 9o, 933 (qi) (q23 (q3, q4) (go, q2) Eqi) go, qi) qi, 94 (q2) (433 lo (43) Use the A-closure algorithm to find its DFA. The DFA must be given as a table, not as a "messy" picture. Do not forget to underline ALL accepting states