Consider the following recursive algorithm.
Algorithm S(n)
if n==1 return 1
else return S(n-1) + n*n*n
a) What does this algorithm compute?
b) Set up and solve a recurrence relation for the number of times the algorithm's basic operation is executed.
c) How does this algorithm compare with the non-recursive algorithm for computing this function in terms of time efficiency and space efficiency?