solution please.

Exercise 8.4.4: Consider the nondeterministic Turing machine M=({q0,q1,q2,qf},{0,1},{0,1,B},,q0,B,{qf}) Informally but clearly describe the language L(M) if consists of the following sets of rules: (q0,0)={(q0,1,R),(q1,1,R)};(q1,1)={(q2,0,L)};(q2,1)= {(q0,1,R)};(q1,B)={(qf,B,R)}