a$.$ Construct a Nondeterministic Finite Automaton $($NFA$)$ for each of the following regular

expressions:

i$.(a|b{)}^{**}$

ii$.,(a^{**}|b^{**}{)}^{**}$

iii. : $((e|a)b^{**}{)}^{**}$

b$.$ Construct a Deterministic Finite Automaton $($DFA$)$ from each NFA.i$.$ and ii$.$ constructed above.

c$.$ Describe the advantages and disadvantages of "generating intermediate code $($such as quads$)$ vs$.$

generating machine code.