Consider the following recursive algorithm for computing the sum of the first n cubes:...

Consider the following recursive algorithm for computing the sum of the first n cubes:

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

b. How does this algorithm compare with the straightforward nonrecursive algorithm for computing this sum?