ALGORITHM $Q(n)$

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

if $n=1$ then

return $1$

else

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

In the worst case, the time efficiency class of $Q$ algorithm in terms of "big$-$O$"$

notation is:

Select one:

a$.O(n^2)$