Here is a nondeterministic finite automaton:

Some input strings lead to more than one state. Find, in the list below, strings that lead from the start state A to three different states $($possibly including A$).$

Select all that apply:

$1010$

$01010$

$0010$

$100010$

$10010$

$11010$

$0110$

$00100$

$1000$

$1110$

$01100$

$00011$

$101000$

$110110$

$010011$

$0000$