$(4\mathrm{.}5$ points$)$ Section $7\mathrm{.}1$ Quertion $3$

Constrinct noda's that accept the following regwlar langunges:

a$)****L=L(aaa**bab)$

b$)L2=L(aa{b}^{**}ab{a}^{**})$

$(7$ points$)$ Section $7\mathrm{.}1$ Question $6$

Constrinct mpda's thar accept the following langmages on $(a,b,c$:$\}$ :

a$)****L=\{a^n{b}^{3n}$:$n0\}$

b$)L=\{a^n{b}^w{c}^{n+m}$:$n0,m0\}$

c$)L=\{w$:$n_a(w)=n_b(w)+1\}$ example strings; abbba,aabbb,bab