Cells on a very long tape are filled with a repeating pattern of symbols from left to right. If the pattern is given by [A B C], then the tape looks like this: ABCABCAB The tape is fed into a machine which can read a symbol one cell at a time. The reader starts with the leftmost symbol on the tape and interprets the symbols as follows: B Move left 1 cell A Move right 2 cells C Move right 3 cells X Stop If the symbol tells the machine to move left or right, it does so, and having completed that move, it then reads the symbol in the new cell. (The machine ignores any symbols it may move over on the way to the new symbol.) Example: for the tape above, the machine will see and execute the following symbols in this order: A C C C C C ... If the first cell is cell 1 , construct a tape pattern that will be guaranteed to visit every prime-numbered cell on the tape (but may also visit other cells). If you need it, use the bracket notation [X,Y,Z] to denote any part of your pattern that repeats. If the symbol tells the machine to move left or right, it does so, and having completed that move, it then reads the symbol in the new cell. (The machine ignores any symbols it may move over on the way to the new symbol.) Example: for the tape above, the machine will see and execute the following symbols in this order: A C C C C C... If the first cell is cell 1 , construct a tape pattern that will be guaranteed to visit every prime-numbered cell on the tape (but may also visit other cells). If you need it, use the bracket notation [X,Y,Z] to denote any part of your pattern that repeats. [AB] AC[B] ABC[A] [AAB] We cannot represent a pattern to visit the prime numbers with only those symbols