$14\mathrm{.}8$: Regular Expressions to Lambda$-$NFA$$s

Let N$1$ and N$2$ be the $\backslash$lambda $-$NFA$$s made from the regular expressions $$a $+($ab$)*$ and $($a $+$ ab$)*$ respectively. Then N$1$ and N$2$ have the same number of states, and the same number of transitions.