Consider the functions power $($base$,$ exp$)$ and betterPower $($base$,$ exp$)$ that recursively calculate the value of base raised to exp.

def power $(b,x)$ :

if $)=(0$ :

return $1$

return $b^{**}$ power $(b,x-1)$

def betterPower$1(b,x$ :

if $)==(0$ :

return $1$

if $x\%2=0$ :

return betterPower$1($b$,$ x$//2)*$ betterPower$1($b$,$ x$//2)$

else:

return $b**$ betterPower $1(b,\frac{x}{\frac{?}{?}}2)**$ betterPower $)$

Compared to power $(b,x),$ betterPower$1(b,x)$ is:

not comparable

has worse Big$-$O time complexity

has better Big$-$O time complexity

has the same Big$-$O time complexity