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

a$.)=(\{a,b\}(2$ marks$)$

b$.|)$:$\}$ does not contain the substring $010$