Implementation of Turning Machine in C Programming

1) Implement in C Programming using the Turing machine whose graph as follows :

2) Explain the logic of the graph (i.e., how it works and 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 )

4) Test your program to multiply each of the following pairs of numbers:

--> 0 and 3; --> 5 and 0; --> 3 and 2; --> 1 and 5

Print all the tape computation sequences from start to end together with the states, the location, the content of the tape, etc. for each of the test case, and include the count of the number of tapes produced.

The turning machine Graph :

The state Transition Diagram (Graph) of the Turing Machine which multiple 2 number n and m : The state Transition Diagram (Graph) of the Turing Machine which multiple 2 number n and m