Section $3\mathrm{.}1$ Regular Expressions

$=\{a,b\}$

Find$($draw$)$ an nfa that accepts the language $($:$L((a+b{)}^{**}$bba$(a+b{)}^{**}ba)\}$

Find $($draw$)$ a dfa that accepts the language $($:$L((a+b{)}^{**}$bba$(a+b{)}^{**}ba)\}$

$**$Find a regular expression for the set $\{\begin{array}{c}{a}^n{b}^m\text{:}n3\\ m\end{array}$ is odd