1) Using the Turing machine whose graph as follows, implement in the programming language of your choice. Explain why that language is chosen.

2) Give the logic of the graph (i.e., clearly explain how it works and say what each part of the graph actually does).

3. Associate each part of the graph to the relevant part of the code (i.e., explain how each part of the graph is implemented in the chosen language)