Question: (b) Examine the following recursive algorithm: ALGORITHM Rec(n) //Input: A positive integer n if n = 1 return 1 else return Rec(n-1)+n*n*n i. Explain what

(b) Examine the following recursive algorithm: ALGORITHM Rec(n) //Input: A positive integer n if n = 1 return 1 else return Rec(n-1)+n*n*n i. Explain what does this algorithm compute? [2 marks] ii. Produce a recurrence relation for this algorithm. [3 marks] iii. Solve the recurrence relations derived in part ii above using the backward substitution method. [4 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
