Use the construction in Theorem $3\mathrm{.}1$ to find an nfa that accepts the language $L(a^{**}a+ab).$

Use the construction in Theorem $3\mathrm{.}1$ to find an nfa that accepts the language $L(a{b}^{**}aa+bb{a}^{**}ab).$

Find dfa's that accept the following languages.

$($a$)**L(a{a}^{**}+ab{a}^{**}{b}^{**})$

Note: You need to build a NFA first and then convert it into DFA

Find regular expressions for the languages accepted by the following automata.

$($c$)$

Note: You need to convert this NFA transition graph to a generalized transition graph first and then get the regular expression from the generalized transition graph.