TM - Computation Example The TM here accepts words with two binary numbers (O's and 7's) separated by a letter a. The execution performs a decrement of the second number (OP2) and an increment of the first number (OPI) until the second number becomes zero. • For example, if we want to add 13 and 5 the tape starts with: ■しかく■しかく1101a101 。 The TM would decrement OP2 and increment OP1 five times until erasing OP2 and the addition symbol (a). The resulting tape should display: ■しかく10010 TM - Computation Example input: 1101a101 output: 10010 The execution performs a decrement of the second number (OP2) and an increment of the first number (OPI) until the second number becomes zero. The TM performs: 1. Go to the beginning of OP2; 2. If OP2 is zero go to Step 7; 3. If OP2 is not zero go to the end of OP2; 4. Subtract one from OP2; 5. Go to the end of OP1; 6. Add one to OP1 and return to Step 1; 7. Erase OP2 and addition symbol a; 8. Return the head to the beginning of OP1; 7 8 9 2 3 5 1 6 TM - Computation Example I. Go to the beginning of OP2; J. If OP2 is zero go to State O; K. If OP2 is not zero go to the end of OP2; L. Subtract one from OP2; M. Go to the end of OP1; N. Add one to OP1 and return to State I; OOR 1/1,R R O. Erase OP2 and addition symbol a; P. Return the head to the beginning of OP1; F. Stop the execution. a/e.l input: 1101a101 output: 10010 සිලවලම e/e.R L OOR 1/IR 1/11 1/1,R e/Cl 10.1 018 €/1.R ■しかく 1101 101 9. Stop the execution.

Develop a C++ program that execute the operation as stated by TM for addition of two binary numbers (see attached image).

• Your code should receive two binary numbers and output the resulting sum (also in binary).
• Make sure your code mimics the TM operations (dealing with the binary numbers as a string of characters 1 and 0, and following the logic to increase the first number and decreasing the second one.

Try your TM for the following examples:

• 1101 and 101, resulting 10010; and
• 1101 and 11, resulting 10000.