Consider the following recursive algorithm

Algorithm Q(n)

if n = 1

return 1

else

return Q(n 1) + (2 * n) 1

a) Determine what the algorithm computes

b) Present the recurrence relation and initial condition for the number of multiplications made by the algorithm