$[4$ marks total$]$ For each of the following languages, draw a state diagram for an NFA that recognizes it$.$

a$.L_a=a(ba{)}^{**}b(ab{)}^{**}(=\{a,b\})(2$ marks$)$

b$.L_b=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}|w\end{array}$ does not contain the substring $010$

HAND DRAW THE DIAGRAMS. DONT USE AI