Describe an algorithm (not a Turing machine but rather explain in words). We want to build a description of a Turing machine that accepts {0 2 n | n 0}. For example 0 is in the language for n = 0. also 00 for n = 1. For n = 2 we get that 0000 is in the language. Also 00000000 for n = 3. Hint: Go over the string and remove every second 0. And then return left. You have to check if the size of the string is not odd. Let me be clear: You should write an algorithm that says: Go over the list from left to right and remove every second 0, etc. Namely explain in words not build a Turing machine. You should note that if you understand the algorithm, making in a program for a Turing machine is a purely technical matter. not a turing machine but an explanation in words!!