Consider the following Turing Machine:

M $=(\{$q$0,$ q$1,$ q$2,$ qf$\},\{1,0\},\{0,1,$ B$\},\backslash$delta $,$ q$0,$ B$,\{$qf$\})$

Describe the language L$($M$)$ if the transition functions, $\backslash$delta $,$ are as follows:

$\backslash$delta $($q$0,0)=$ q$1,1,$ R$)\backslash$delta $($q$1,1)=$ q$0,0,$ R$)\backslash$delta $($q$1,$ B$)=$ qf$,$ B$,$ R$)$