Convert the following NFA to DFA using

A$.\{0,1,2\}\{0,2\}$

B$.\{0\},\{0,1\},\{0,2\}$

C$.\{0\}\{1,2\}\{0,1,2\}$

D$.\{0,2\},\{1,2\},\{2\}$

$\backslash$table$[[9.,,$D$.$ Kignumosi uerivanon in reverse$],[$in the compiler?,$\backslash$table$[[$A$.$ Parser$],[$B$.$ Code optimizer$],[$C$.$ Code generator$],[$D$.$ Scanner$]],]]$

$($a$)$ is illegal token,Not existed in

A$.$ Scanner

the language

B$.$ Parser

C$.$ Semantic analyzer

D$.$ Code generation