Recall that any Regular Expression can be simulated by an NFA.

$($a$)$ Construct the NFA for the regular expression $(a{b}^{*}|).($You could construct the NFA using $lon-$transitions, but it is not necessary to do so$)$

$($b$)$ Show that the expression aaaa will NOT be accepted by this machine. To show this, simulate the machine after reading each symbol, including the empty symbol.

$($c$)$ Show that the expression abab will be accepted by this machine. To show this, simulate the machine after reading each symbol, including the empty symbol.