Answer Happy

1. Let Q be a Turing machine with two tapes and two states, defined as follows: O Q($,$, Initial) ($,$, Initial, +1) Q(6,6, Initial) = (6,6, Final,0) • QC, |, Initial) = (1,5,Initial, +1) • Q(1,6, Initial) = (1,1, Initial, +1) • Q(6,1,Initial) = (1,1,Initial, +1) = Assuming that the machine starts with both tapes representing integers, what does the machine do?