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,\frac{x}{\frac{?}{?}}2)**$ betterPower $1(b,\frac{x}{\frac{?}{?}}2)$

else:

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

Which of the following is true about the space complexity of better Power$1?$

$O(1)$

$O(log(n))$

$O(n^2)$

$O(n)$

None of the other selections are correct