Problem #1 Given the following NFA: N-Q, .90, {q4) where q0 is the starting state, {q4} is the set of final (accepting) states (one state), Q = {q0.91.92.93.94), = { 1,2,3} and the -transition summary table is: go, q13 (go, q3) iq,J 1q23 (q3, q43 (go, q2) qi) 10 (92) (q3J 92 1q3) Use the -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