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

(q,a) 0 1 B

q₀ (q₀,1,R) (q₁,1,R) (q_f,B,R)

q₁ (q₂,0,L) (q₂,1,L) (q₂,B,L)

q₂ - (q₀,0,R) -

q_f - - -

Deduce what M does on any input of 0's and 1's. Hint: consider what happens when M is started in state q₀ at the left end of a sequence of any number of 0's (including zero of them) and a 1. Demonstrate your understanding by identifying the true transition of M from the list below.

a) q₀0101 |-* 1010q_f

b) q₀0011 |-* 1100Bq_f

c) q₀1010 |-* 1101Bq_f

d) q₀1010 |-* 1001Bq_f

Explain me the ans plz