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$