Hi, I have a state transition table that consists of states and input symbols in NFA. I need to convert it into DFA.

Below is my solution. Please correct any errors that I may have. Thanks.

Note: state 2 is my final state.

2.2. For each of the following NFAs, draw the state diagram, trace its operation on each of the strings shown, and indicate which of them are accepted (e)1.2 Strings: aaab,bab , ababab,baab,aba 2() 2, 3) 3 ) 1, 2 alb 2- I E123 833 24 23 3 23 2(11) E1yb8 (3) u (2,3) 123