procedure foo(x, y)

Input: x: integer, y: nonnegative integer

Output: ???

if y==0 then return x

else return (foo(x, y-1))^ 3

How to do question 3?

2. (2 pt.) What is the output of algorithm foo for any input x and y, where x is an integer and y is a nonnegative integer? 3. (20 pt.) Prove that algorithm foo is correct using induction. Answer the following questions. (4 pt.) Complete the basis step of the proof by showing that the base case is true. (4 pt.) What is the inductive hypothesis? (4 pt.) What do you need to show in the inductive step of the proof? (8 pt.) Complete the inductive step of the proof a. b. c. d