Question 2: Construct a Turing machine with three tapes that gets as input two integers . E G and y E i}, and returns as output the number 3:...

the question of introduction to THeory of computation

Question 2: Construct a Turing machine with three tapes that gets as input two integers.1: E G and y E i}, and returns as output the number 3: +y. Integers are represented in binary. Start of the computation: Tape 1 contains the binary representation of .r, its head ison the rightmost bit of .r. Tape 2 contains the binary representation of 3;, its head is onthe rightmost bit of y. Tape 3 is empty [that is, it contains only D's}, its head is at anarbitrary plltlflll. At the start1 the Turing machine is in the start state. 1 End of the computation: Tapes 1 and 2 are empty, and tape 3 contains the binaryrepresentation of the number :I.‘ + y. The head of tape 3 is on the rightmost bit of :r + y. The Turing machine is in the final state. The Turing machine in this question does not have an accept state or a reject stat-e; instead, it has a final state. As soon as this final state is entered, the Turing machine terminates. At termination, the contents of the tape is the output of the Turing machine.Start by explaining your algorithm in plain English, then mention the states that you are going to use, then explain the meaning of these states, and finafly give the list of instructions.