Material from slide pack $3\mathrm{.}4$ is needed to answer this question.

Assuming that you have the three automata, $A_1,A_2,A_3$ shown underneath as black boxes. These automata recognize

the languages $L_1,L_2,L_3$ respectively.

a$.(7$ marks$)$ Draw an NFA called A that recognizes the language $(L_2{L}_3^{**})L_1^{**}{L}_3$

b$.(1$ mark$)$ Indicate clearly on your drawing what is the starting state of $A$

c$.(2$ marks$)$ Indicate clearly on your drawing what are A$\text{'}$s final states.