(R-4.3) Draw the recursion trace for the computation of power(2,18), using the repeated squaring algorithm, as implemented below: def power (x, n): ""Compute the value x**n for integer n. "!" if n == 0: return 1 else: partial = power (x, n // 2) # rely on truncated division result = partial * partial if n % 2 == 1: # if n odd, include extra factor of x result *= x return result