4.4 Construct a Turing machine with one tape that receives as input a non- negative integer r and returns as output the integer r1. Integers are represented as binary strings. Start of the computation: The tape contains the binary representation of the input x. The tape head is on the leftmost symbol and the Turing machine is in the start state go. For example, if x = 431, the tape looks as follows: | End of the computation: The tape contains the binary representation of the integer r +1. The tape head is on the leftmost symbol and the Turing machine is in the final state . For our example, the tape looks as follows: 1|1|0|1| 1 | 0 | 0 | 0 | 0 | The Turing machine in this exercise does not have an accept state or a reject state; instead, it has a final state q1. As soon as state q is entere, the Turing machine terminates. At termination, the contents of the tape is the output of the Turing machine