10. Let SuccConfig(e, x, y) equal the encoding of the configuration that follows the configuration encoded by y in the computation of Pe on input r. It can be shown that SuccConfig is primitive recursive. Now let f(e, x, y) = f(g(e, x,y) denote the encoding of the y th configuration of the computation of Pe on input x. Show that f(e,x,y) is a primitive-recursive function. Hint: use recursion. For the base case, you'll need to use MaxReg and the defintion of T. (10 points) 10. Let SuccConfig(e, x, y) equal the encoding of the configuration that follows the configuration encoded by y in the computation of Pe on input r. It can be shown that SuccConfig is primitive recursive. Now let f(e, x, y) = f(g(e, x,y) denote the encoding of the y th configuration of the computation of Pe on input x. Show that f(e,x,y) is a primitive-recursive function. Hint: use recursion. For the base case, you'll need to use MaxReg and the defintion of T. (10 points)