Automata

Given the following NFA: N = (Q, Sigma, delta, S_0, {S_4}) where S_0 is the starting state, {S_4} is the set of final states (one state), Q = {S_0, S_1, S_2, S_3, S_4}, Sigma = {1, 2, 3} and the delta-transition summary table is: Draw the NFA. Make it as clean and neat as possible. Use the lambda-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. Show all possible delta-derivations for the strings given below to determine if they are or are not in L(N)?. (USE the abbreviation = "not accepting final state", where appropriate) 31232 33221