$($b$)$ Give the state diagram for an NFA which decides the language B over $\backslash$Sigma $=\{0,1\}.$

Make sure to clearly indicate your start state and final state$($s$).$

B $=(1(0\backslash$cup $1)$

$0)\backslash$cup $0$