Q: Give implementation-level pseudo-code for a Turing Machine that decides the language.L4 containing all binary strings that have length that is a multiple of 7. (You need only explain how the tape...

Extracted text: Q: Give implementation-level pseudo-code for a Turing Machine that decides the language.L4 containing all binary strings that have length that is a multiple of 7. (You need only explain how the tape will be used in the algorithm and do not have to give all states of the finite control or the transition function.) Trace your implementation on one string that would be accepted and another string that would be rejected by your Turing machine.