Use the template provided by your professor to simulate the Turing machine represented in the following State Diagram.

$Q=\{q_1,$dots,$q_8,q_{\text{a}\text{c}\text{c}\text{e}\text{p}\text{t}},q_{\text{r}\text{e}\text{j}\text{e}\text{c}\text{t}}\},$

$=\{0,1,$#$\},$ and $=\{0,1,$#$,x,\}.$

We describe $$ with a state diagram $($see the following figure$).$

The start, accept, and reject states are $q_1,q_{\text{a}\text{c}\text{c}\text{e}\text{p}\text{t}},$ and $q_{\text{r}\text{e}\text{j}\text{e}\text{c}\text{t}},$ respectively.

Test the Turing machine using different test cases. Some of them accepted and some of them rejected. Submit the python code alongside the different test cases.