2. (15 pts.) Find an exact closed-form formula for A(n), the worst-case number of addi- tions performed by the following function on input n: procedure Q(n) if n = 1 then return n 1 return 2+3+n+ Q(n-) Q(n-1)