Analyze the following recursive algorithm for computing the sum of the first n cubes: Algorithm S(n) if n=1 return 1 else return S(n-1) +n*n*n Set up and solve the recurrence relation for the runtime of this algorithm. Denote the runtime by T(n)