Example $1\mathrm{.}56$ in the text illustrates the general conversion from a regular expression to an NFA

for the regular expression $($ab $\backslash$cup a$)$

$$ using the NFA constructions outlined in class. Using your understanding

of the specific language, $\{$w$1...$ wk $|$ k $>=0,$ wi $=$ ab or a for i $=1,...,$ k$\},$ design a smaller two$-$state NFA

equivalent to $($ab $\backslash$cup a$)$

$$

$.$ Include both a state diagram and a formal $5-$tuple specification of your NFA