Let e be the regular expression ab $+($b$^$a$)^$ over the alphabet A $=\{$a$,$ b$\}.$

Use the $$toolkit$$ from the lecture to construct an NFA$-\backslash$lambda that accepts L$($e$).$ The

$($non$-$trivial$)$ intermediate steps must be given as part of the solution.