Create an NFA for $=\{$a$,$b$\}$ that accepts the COMPLEMENT of the language defined by the following NFA:

states: $\{$q$0,$q$1,$q$2\}$

input alphabet: $\{$a$,$b$\}$

initial state: q$0$

final states: $\{$q$1\}$

transitions:

$($q$0,$a$)=\{$q$2\}$

$($q$0,$$)=\{$q$1\}$

$($q$1,$a$)=\{$q$2\}$

$($q$2,$b$)=\{$q$0,$q$1\}$

Please explain your steps and provide a graph drawing of the resulting NFA