Construct a Turing machine that implements the SHIFT instruction. The input is a binary string flanked by x characters, and the output is the binary string shifted right by one bit. The rightmost bit is deleted, the string is padded on the left with a 0, and the final result is flanked by x characters. Example: x11001x becomes x01100x