Consider a single-tape deterministic Turing machine with inputalphabet Σ = {0, 1} and tape alphabet Γ = {0, 1, 2, ♦}. The Turingmachine accepts the language given by the regular expression 1∗.
Additionally, for every input string w in the language, theTuring machine writes the value of (|w| mod 3) on the tapeimmediately following w.
Give a diagram of this Turing Machine.
Answer