Let the NFA be defined as having states Q $=\{$M$,$ N$\},$ with M being the start state, N being the only accepting state, and M$->$N on $0,$ while N$->$N on $1,$ and N$->$M on $0.$ Note there is no transition arc for M on a $1.10$ points.

HINT: Stating what language the machine accepts can help you double check your answer