Consider the Turing machine M $=(\{$s$,$ q$0,$ q$1,$ q$2,$ t$,$ r$\},\{0,1\},\{0,1,$ t$\},`,$ t$,\backslash$delta $,$ s$,$ t$,$ r$),$

where s$,$ t$,$ and r are the start state, accept state, and the reject state, respec$-$

tively. Whenever M stucks, it automatically goes to the reject state. Once M

enters the accept or the reject states, it remains in the same state.

Clearly describe the languge L$($M$)$ if $\backslash$delta consists of the following rules: