Consider the following Turing machine:

$M=(\{q_0,q_1,q_2,q_{\text{a}\text{c}\text{c}},q_{\text{r}\text{e}\text{j}}\},\{0,1\},\{0,1,B\},,q_0,q_{\text{a}\text{c}\text{c}},q_{\text{r}\text{e}\text{j}})$

where $B$ denotes the blank symbol. Describe the language $L(M)$ if $$ consists of the

following sets of rules $($if an entry $(q,a)$ is missing, by default it means that the Turing

machine enters $q_{\text{r}\text{e}\text{j}}).$ No justification is needed.