Given the following recursive algorithm: procedure foo(x, y) Input: x integer, y: nonnegative integer Output: ??? if y==0 then return x else return (foo (x, y-1))' Prove that algorithm foo is correct using induction. Answer the following questions. a. Complete the basis step of the proof by showing that the base case is true. b. What is the inductive hypothesis? c. What do you need to show in the inductive step of the proof? d. Complete the inductive step of the proof