Consider the following algorithm: Algorithm S(n) //Input: A positive integer n //Output: The sum of the first n cubes if n=1 return 1 else return S(n 1) +n*n*n Part a: What is the basic operation? Give a brief justification of your answer. Part b: Give the recurrence relation that quantifies the number of times this operation occurs for an input size of n