The pseudo$-$code below gives an algorithm to compute $2^n,$ assuming that $n$ is an

integer such that $n0.$ Select the recurrence relation that describes the

complexity of the algorithm as a function of $n,$ the input integer.