$($a$)$ Find an nfa with three states that accepts the language

$L=\{a^n$:$n1\}\{b^m{a}^k$:$m0,k0\}.$

$($b$)$ Do you think the language in part $($a$)$ can be accepted by an nfa

with fewer than three states?