Describe a notion of a universal register machine analogous to that of a universal Turing machine, and sketch a proof to the effect that such a universal register machine exists. Assume that the universal register machine begins with registers R1, . . . , Rk with the input of the machine to be simulated, and Rk+1 contains the encoding of the machine to be simulated, from the answer to the previous question.