for part b: you need to draw the computation tree for string aaabb.

3. Let M be the nondeterministic finite automaton 9o 91 92 a) Construct the transition table of M. b) Trace all computations of the string aaabb in M. 3. Let M be the nondeterministic finite automaton 9o 91 92 a) Construct the transition table of M. b) Trace all computations of the string aaabb in M