Construct a Turing machine (your answer must show all of the 5-tuples involved) that computes n mod 3, where n ≥ 0. You must use unary ones format: 0 is 1 , 1 is 11 , 2 is 111 , and n is n+1 1s. Note...

Construct a Turing machine (your answer must show all of the 5-tuples involved) that computes n mod 3, where n ≥ 0. You must use unary ones format: 0 is
1, 1 is
11, 2 is
111, and n is n+1 1s.
Note that all computations: of n mod m must be either 0 (1), 1 (11), or 2 (111).
Be sure to leave the read/write head over the leftmost 1 when done.
Verify your Turing machine by giving a step-by-step trace of 2 mod 3 and 7 mod 3.