Let N be a $1-$NFA with state set $\{1,2,3,4\},$ start state $1,$ only final state $4,$ and transitions $(1,1,2),(1,$ a$,2),(2,1,3),(2,$ b$,4),(3,$ a$,4),(4,$ a$,1),$ and $(4,$ b$,4).$ There should be $8$ a moves and $3$ b moves. a$.)$ construct a regular nfa. b$.)$ construct a dfa.