Extra credit: 5. [20 points] Set up and solve a recurrence relation for the number of multiplications made by the following recursive algorithm for computing the sum of o the first n cubes: ALGORITHM Cubes (n) / / Input: A nonnegative integer n / / Output: The sum of the first n cubes if n=1 return 1 else return Cubes (n1)+nnn