2. Draw the diagram for a one-tape Turing machine that solves

Construct a Turing machine with one tape that receives as input a nonnegative integer x and returns as output the integer x + 1. Integers are represented as binary strings. 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 q_0. For example, if x = 431, the tape looks as follows: End of the computation: The tape contains the binary representation of the integer x + 1. The tape head is on the leftmost symbol and the Turing machine is in the final state q_1. For our example, the tape looks as follows: The Turing machine in this exercise does not have an accept state or a reject state; instead, it has a final state q_1. As soon as state q_1 is entered, the Turing machine terminates. At termination, the contents of the tape is the output of the Turing machine. Construct a Turing machine with one tape that receives as input a nonnegative integer x and returns as output the integer x + 1. Integers are represented as binary strings. 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 q_0. For example, if x = 431, the tape looks as follows: End of the computation: The tape contains the binary representation of the integer x + 1. The tape head is on the leftmost symbol and the Turing machine is in the final state q_1. For our example, the tape looks as follows: The Turing machine in this exercise does not have an accept state or a reject state; instead, it has a final state q_1. As soon as state q_1 is entered, the Turing machine terminates. At termination, the contents of the tape is the output of the Turing machine