Problem 2: Suppose you have a new multi-core Turing machine. The multi-core TM has tapes, a separate head for each tape, and a separate state for each head. The transition function for the multi-core TM is 8:Qk x Tk + Qk x Tk x {L, R, S}k Initially, the input is on the first tape, and all the other tapes are blank. You can program the machine two ways. You can choose to have the machine accept once all cores enter the accept state, or you can have the machine accept once one of the cores enters the accept state. Prove that any language that the multi-core Turing machine decides can also be decided by normal, single tape, single head TM. Problem 2: Suppose you have a new multi-core Turing machine. The multi-core TM has tapes, a separate head for each tape, and a separate state for each head. The transition function for the multi-core TM is 8:Qk x Tk + Qk x Tk x {L, R, S}k Initially, the input is on the first tape, and all the other tapes are blank. You can program the machine two ways. You can choose to have the machine accept once all cores enter the accept state, or you can have the machine accept once one of the cores enters the accept state. Prove that any language that the multi-core Turing machine decides can also be decided by normal, single tape, single head TM