Compilers 2-14- Construct an NFA that recognizes the RE a(abc)- and fi.pdf

An NFA that recognizes the regular expression "a(abc)" would have 5 states with the first state being the start state that transitions to itself on 'a' and to state 2 on 'a'. State 2 transitions to itself on 'a', 'b', and 'c' and back to state 1. The equivalent DFA would have 5 states with the transitions between the states determined by the NFA.