Construct a one-tape Turing machine that receives as input the binary representation of some integer x greaterthanorequalto 1 and terminates in the accepting state with the binary representation of x - 1 written on the tape. For example, if the input is 1011000 (the binary representation of 88), then the final contents of the tape should be 1010111 (the binary representation of 87). If the input is 1000, then the final contents of the tape should be 111. If the input is 1, then the final contents should be 0. At the start of the computation, the tape head is on the leftmost symbol of the binary string. When you finish your computation, the tape head should be on the leftmost symbol of the new binary string