# finite automata – NFA designing for strings starting with \$01\$

Construct an NFA with set of all strings that start with $$10$$.
But my question is what if the automaton receives an input $$0$$ at the starting? Also there is no option for $$q_1$$ to transit after receiving $$1$$. So I think the solution should be