Consider the following recursive algorithm

Algorithm S(n)

if n==1 return 1

else return S(n-1) + n*n*n

1)What does this algorithm compute?

2) Set up and solve a recurrence relation for the number of times the algorithm's basic operation is executed.

3) How does this algorithm compare with the non-recusive algorithm for computing thius function in terms of time efficeincy and space effeciency?