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

L $=\{$an : n $>=1\}\backslash$cup $\{$bmak : m $>=0,$ k $>=0\}$