Consider the following recursive algorithm.

Algorithm Q(n) // Input: A positive integer n

if n = 1 return 1

else return Qn-1*n*n+3*n

(a) Set up a recurrence relation for the number of basic operations made by this algorithm.

(b) Solve a recurrence relation in (a).