$55$ points

Turing Machine $M$ has $7$ states $\{q_0,q_1,q_2,q_3,q_4,q_{\text{a}\text{c}\text{c}\text{e}\text{p}\text{t}},q_{\text{r}\text{e}\text{j}\text{e}\text{c}\text{t}}\}$

The alphabet is $=\{0,1\}$

The start state is $q_0$

Assume missing transitions go to a reject state.

Write the sequence of configurations for the following input

$11$

$01110$

Describe in a few words the behavior of the TM on input $10$

What is the language of this TM$?$

Does this TM decide, recognizes L or neither?