Construct a nondeterministic finite$-$state automaton that recognizes the

language generated by the regular grammar G $=($V$,$ T$,$ S$,$ P$),$ where V $=\{0,1,$ S$,$ A$,$ B$\},$ T $=$

$\{0,1\},$ S is the start symbol, and the set of productions is

S $->1$A$,$ S $->0,$ A $->1$A$,$ A $->0$B$,$ A $->1,$ B $->0$A$,$ B $->1$