Design a (2-way infinite) total turing machine that takes a binary number x as input (is non- empty) and writes x-3 (in binary) on the tape and halts. Assume the input x to satisfy the condition 2i<= x-3 < x < 2i+1, for some positive integer i. Further, the tape head being positioned on the first blank symbol to the left of the leftmost bit (the most significant bit). The final head position can be anywhere on the tape