ALGORITHM Q$($n$)$

$//$Input: A positive integer n

if n $=1$ return $1$

else return Q$($n $1)+2$ n $1$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 to deter$-$

mine what this algorithm computes.

b$.$ Set up a recurrence relation for the number of multiplications made by this

algorithm and solve it$.$

c$.$ Set up a recurrence relation for the number of additions$/$subtractions made

by this algorithm and solve it$.$