Give a state diagram of an NFA to recognize the following language: $$ L=\left\{0^{a} 1^{b} 0^{c}: a \geq 0, b \geq 0 \text { and } c> ight\} . $$ Try to use only three states in your NFA. (No proof of correctness is needed.) cs.vs. 1206