Consider the following recursive algorithm.

ALGORITHM $Q(n)$

$//$Input: A positive integer $n$

if $n=1$ return $1$

else return $Q(n-1)+2**n-1$

a$.$ Set up a recurrence relation for this function's values and solve it mine what this algorithm computes.

b$.$ Set up a recurrence relation for the number of multiplications ma algorithm and solve it$.$

Formula you can use as follows to solve the questions:

Important Summation Formulas