This is for NFA.

$($a$)$ Find an NFA with four states that accepts the language

$L=\{a^{n}b$:$n0\}\{a{b}^m$:$m0\}.[5pts]$

$($b$)$ Do you think the language in part $($a$)$ can be accepted by an DFA with four states? Explain

your answer. $[5$ pts$]$