Question $1$

A Turing Machine is defined by the following $5$ tuples:

$(0,0,1,0,R)$

$(0,1,1,1,L)$

$(0,b,b,0,L)$

$(1,0,0,1,L)$

$(1,1,0,1,R)$

The initial configuration is shown below:

Select the correct statements below:

There is no $\text{'}0\text{'}$ on the tape when the machine halts.

Rule $(0,1,1,1,L)$ is never applied.

Rule $(1,0,0,1,L)$ is never applied.

This Turing Machine will halt.