Which statement best describes the running time of this recu…
Which statement best describes the running time of this recursive exponentiation function in terms of n? def power_better(x, n): if n == 0: return 1 if n == 1: return x if n == 2: return x * x half = power_better(x, n // 2) if n % 2 == 0: return half * half return x * half * half