$20$ pts$,10$ pts each$)$ For each of the following languages of strings over $\{$a$,$ b$\},$ draw a NFA

accepting that language.

$($a$)$ The language of all strings of an even length where every odd character $($if any$)$ is a b$.$

$($b$)$ The language of all strings that end in ab or bba.

$1$