Consider the following single$-$step grammar:

A $->0$B $|1$C

B $->0$A $|1$D

C $->1$A $|0$D $|\backslash$epsi

D $->1$B $|0$C

Give the state diagram for an NFA which decides the same language as this grammar.