Consider the following Turing machine:

M $=$

$\{$q$0,$ q$1,$ q$2,$ qacc, qrej$\},\{0,1\},\{0,1,$ B$\},\backslash$delta $,$ q$0,$ qacc, qrej

$,$

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

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

machine enters qrej$).$ No justification is needed.

a$)\backslash$delta $($q$0,0)=($q$1,1,$ R$)$; $\backslash$delta $($q$1,1)=($q$0,0,$ R$)$; $\backslash$delta $($q$1,$ B$)=($qacc$,$ B$,$ R$).$

b$)\backslash$delta $($q$0,0)=($q$1,1,$ R$)$; $\backslash$delta $($q$1,1)=($q$2,0,$ L$)$; $\backslash$delta $($q$2,1)=($q$0,1,$ R$)$; $\backslash$delta $($q$1,$ B$)=($qacc$,$ B$,$ R$).$