Consider the following Turing machine: M has

$4$

$$states

$\{$

$$

$0$

$,$

$$

$1$

$,$

$$

a

c

c

e

p

t

$,$

$$

r

e

j

e

c

t

$\}$

$$

$=$

$\{$

$0$

$,$

$1$

$\}$

$$and the start state is

$$

$0$

$.$

What isthe language

$$

$($

$$

$)$

$$if the transition function

$$

$$consists of the following:

$($

assume unspecified transitions go to the reject state

$)$

$$

$($

$$

$0$

$,$

$0$

$)$

$=$

$($

$$

$1$

$,$

$1$

$,$

$$

$)$

;

$$

$$

$($

$$

$1$

$,$

$1$

$)$

$=$

$($

$$

$0$

$,$

$0$

$,$

$$

$)$

;

$$

$$

$($

$$

$1$

$,$

$$

$)$

$=$

$($

$$

a

c

c

e

p

t

$,$

$$

$,$

$$

$)$