Consider the nondeterministic Turing machine $M=\left(\left\{q_{0},q_{1},q_{2},q_{f}\right\},\left\{0,1 \right\},\left\{0,1,B \right\} ,\delta,q_{0},B,q_{f}\right)$
Informally but clearly describe the language $L(M)$ if $\delta$ consists of the following sets of rules:$\delta(q_{0},0) = \left\{(q_{0},1,R),(q_{1},1,R)\right\}; \delta(q_{1},1) = \left\{(q_{2},0,L)\right\}; \delta(q_{2},1) = \left\{(q_{0},1,R)\right\}; \delta(q_{1},B) = \left\{(q_{f},B,R)\right\}.$
