Question: 4. Divide-and-Conquer (Factorial): (10 points) Suppose that you are provided with the following pseudocode for computing the factorial for a given integer n 20: 1:
4. Divide-and-Conquer (Factorial): (10 points) Suppose that you are provided with the following pseudocode for computing the factorial for a given integer n 20: 1: procedure FACTORIAL(n) 2 if n 1 ther 3: 4: else 5: return nx Factorial (n-1) 6: end if 7: end procedure return 1 (a) (3 points) Write down the recurrence relation for the above algorithm including the base case. (b) (7 points) Solve the recurrence using any method you prefer. Make sure to show all your work
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
