Let us consider the Turing machine M? = ({S0, S1, S2, S3, S4, S5}, {0, 1, 2}, {0, 1, 2, x, y, z, \textvisiblespace}, d, s0), with the following transition function
represented as a table:
d\\
0\\
1\\
2\\
x\\
y\\
z\\
-\\
S0\\
(S1, x, R)\\
Æ\\
Æ\\
Æ\\
(S4, y, R)\\
Æ\\
Æ\\
S1\\
(S1, 0, R)\\
(S2, y, R)\\
Æ\\
Æ\\
(S1, y, R)\\
Æ\\
Æ\\
S2\\
Æ\\
(S2, 1, R)\\
(S3, z, L)\\
Æ\\
Æ\\
(S2, z, R)\\
Æ\\
S3\\
(S3, 0, L)\\
(S3, 1, L)\\
Æ\\
(S0, x, R)\\
(S3, y, L)\\
(S3, z, L)\\
Æ\\
S4\\
Æ\\
Æ\\
Æ\\
Æ\\
(S4, y, R)\\
(S4, z, R)\\
(h_a, -, R)\\
1. Show that 001122 is accepted by M?. Describe the step-by-step transitions of the Turing machine when accepting this string;\\
2. What is L(M?)?