Let M be any deterministic Turing machine which has exactly four states, q, p, s, and t, input alphabet {x, y}, and tape alphabet {x, y, 1}. Design another (multi- tape) Turing machine, U (a restricted version of the universal Turing machine) which will simulate one step of M, given Ms transition function. That is, M will start with the the transition function of M, followed by a blank, followed by a configuration of M on its input tape. It will write the next configuration of M to its output tape. U will have the input and tape alphabet {q, p, s, t, x, y, 1, b, r, l} where q, p, s, and t will be used to represent the corresponding states of M, x, y, and 1 will represent Ms tape alphabet, b will stand for Ms blank, and l and r will stand for Ms L and R actions, respectively, in both the description of Ms transition function and configuration. For example, if the input tape consists of qb1qqxyqq1lppb1pp1lssb1sBqb that means that Ms transition function is hq, B, 1, qi hq, x, y, qi hq, 1, L, pi hp, B, 1, pi hp, 1, L, si hs, B, 1, si and its current configuration is in state q with the tape head pointing to a blank on a blank tape. The output should be the result of one step of M, that is, the output configuration is q1. If the input configuration was q1 the output would be pB1. If the input configuration was xq1 the output would be px1. (Since Us tape alphabet contains all the states and tape symbols of M, theres no need to do any standardized encoding.)