Question $3.$ Example $1\mathrm{.}56$ in the text illustrates the general conversion from a regular expression to an NFA for the regular expression $(aba{)}^{**}$ using the NFA constructions outlined in class. Using your understanding of the specific language, $|0$ or a for $\{$:$i=1,$dots,$k\},$ design a smaller two$-$state NFA equivalent to $(aba{)}^{**}.$ Include both a state diagram and a formal $5-$tuple specification of your NFA.