Consider the NFA M = ({S, A, B}, {a, b}, , S, {B})

with transitions

(S, a) = {S, A} (A, b) = {A, B} (B, a) = {B}

a. Draw the transition graph for the NFA.

b. Convert the NFA into an equivalent DFA.

c. Find a regular expression for the L(M).

d. Construct a right-linear grammar for L(M).

e. Construct a derivation for abbbaa using your grammar.