Definition (Oracle Turing Machine). Let fo : {0,1}. {0,1} be a decision function. Say that a Turing Machine M* is enhanced with oracle access to fo if: 1. M* it has two extra tapes, the "fo-input" and "fo-output" tapes; and 2. during each time step, M* is allowed to "apply fo", in which case M writes fo(x) on the fo-output tape where x E 10, 1* is the string written on the fo-input tape. Problem 2. Let f, fo : {0,1}* {0, 1) and T.To : N N be decision and time functions. Suppose that a Turing Machine M which is enhanced with oracle access to fo computes f in time T. Suppose, furthermore, that a standard Turing Machine Mo computes fo in time To Construct a standard Turing Machine M (with as many tapes as you like) which computes f in time T . To