A nondeterministic Turing machine M with start state q0 and accepting state qf has the following transition function:

(q,a) 0 1 B

q₀ {(q₁,0,R)} {(q₁,0,R)} {(q₁,0,R)}

q₁ {(q₁,1,R), (q₂,0,L)} {(q₁,1,R), (q₂,1,L)} {(q₁,1,R), (q₂,B,L)}

q₂ {(q_f,0,R)} {(q₂,1,L)} {}

q_f {} {} {}

Deduce what M does on any input of 0's and 1's. Demonstrate your understanding by identifying, from the list below, the ID that CANNOT be reached on some number of moves from the initial ID q₀101011001.

a) 0q₂011011101

b) 0q_f111111111

c) 01111q₂1101

d) 01111q₂111111111

Solution plz explain