Describe a Turing machine that solves the specified decision problem. Use Example 11.1.2 as a model for defining the actions of a computation of the machine. You need not explicitly construct the transition function.
Design a Turing machine whose computations decide whether a natural number is prime. Represent the natural number $n$ by a sequence of $n+1 l$ 's.