For this question, the function is already given to you. You have to prove the function for be following questions.

ctness (21 marks) In this question you will use strong induction to prove that your new algorithm works correctly. In other words, you will prove that VnEN VxeR-{0} FP(x,n) = xn al Predicate Function (1 mark) a) Predicate Function (1 mark) Your conjecture has already been stated in symbolic form: It is a statement of the form VneN, P(n) What is the predicate function P(n)? b) Proof: Base cases (4 marks) c) Proof: Inductive step setup (2 marks) This is the beginning of the inductive step where you are stating the assumptions in the inductive step and what you will be proving in that step. As you do so, identify the inductive hypothesis. d) Proof: Inductive step (14 marks) ctness (21 marks) In this question you will use strong induction to prove that your new algorithm works correctly. In other words, you will prove that VnEN VxeR-{0} FP(x,n) = xn al Predicate Function (1 mark) a) Predicate Function (1 mark) Your conjecture has already been stated in symbolic form: It is a statement of the form VneN, P(n) What is the predicate function P(n)? b) Proof: Base cases (4 marks) c) Proof: Inductive step setup (2 marks) This is the beginning of the inductive step where you are stating the assumptions in the inductive step and what you will be proving in that step. As you do so, identify the inductive hypothesis. d) Proof: Inductive step (14 marks)