Convert the NFA defined by $\backslash$delta $($q$0,$a$)=\{$q$0\}\backslash$delta $($q$0,$b$)=\{$q$1,$q$2\}\backslash$delta $($q$1,$a$)=\{$q$1,$q$2\}\backslash$delta $($q$1,$b$)=\{$q$2\}\backslash$delta $($q$2,$a$)=\{$q$0,$q$1\}\backslash$delta $($q$2,$b$)=\{$q$1\}$ with initial state q$0$ and final state q$2$ into an equivalent DFA. Use JFLAP software to create the NFA and test it with sample string, then create its equivalent DFA and test it with the same sample strings, show that both automata accepts and rejects same strings.