Here is a description of a Turing machine. The input alphabet is $($a$,$ b$).$ The state set is: Here is a description of a Turing machine. The input alphabet is $\{a,b\}.$ The state set is:

$\{q_0,q_1,q_2,q_3,q_4,q_{\text{a}\text{c}\text{c}},q_{\text{r}\text{e}\text{j}}\}$

The transition function is given in the table below:

For how many steps does the Turing machine run on input string $"$a$"$ before the Turing machine halts?

Does the Turing machine accept the string $"$a$"?$

$\{$Q$\_0,$ Q$\_1,$ Q$\_2,$ Q$\_3,$ Q$\_4,$ Q$\_0$ c c Q$\_1+\}$

The transition function is given in the table below: $($a$)$ Draw the configuration of the Turing machine after $3$ steps on input 'aabba'. When the Turing machine is in the initial configuration, it has executed zero steps. Solution a Visible to students $($b$)$ For how many steps does the Turing machine run on input string $\text{'}$a$\text{'}$ before the Turing machine halts? Does the Turing machine accept the string $\text{'}$a$?$ Visible to students $($c$)$ Simulate the Turing machine on input "aaba". Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration the Turing machine is either in the accept or reject state. Visible to students