Shown below is a Turing Machine (start state is 0).
1/1,R
0/0,R
?/?,L
1
3
1/?,R
1/?,L
1/1,L
0/0,L
?/?,R
0/?,R
1/1,R
0/0,R
?/?,L
2
5
?/?,S
H
If a string '1001' is placed on the input tape as shown below:
?
1
0
0
and the TM goes through the following sequence of transitions.
(S,?,R,1) -> (1,0,0,R,1) -> (1,0,0,R,1) -> (1,1,R,1) -> (1,?,?,L,3) -> (3,1,?,L,4)
how does the tape looks like after the sequence of transitions? Complete the contents of two cells on the tape below.
?
?