Find an NFA that accepts the language L $=($b $+$ ab$)($a $+$ ab$).$ In addition of

drawing the transition diagram, write explicitly all the outcomes of the transi$-$

tion function different from the empty set $($i$.$e$.$ the ones corresponding to arrows

in the diagram$).$ Specify the set of accepting states and the $-$closure of the

initial state. Finally, specify the set given by $($q$0,$ a$),$ being q$0$ the initial state.