This function is supposed to recursively compute x to the po…

This function is supposed to recursively compute x to the power n, where x and n are both non-negative: 1. def power(x: int, n: int) -> int:2.     if n == 0 :3.         ________________________________4.     else :5.         return x * power(x, n – 1) What code should be placed in the blank to accomplish this goal?

Consider the function powerOfTwo shown below: 1. def powerOf…

Consider the function powerOfTwo shown below: 1. def powerOfTwo(n: int) -> bool :2.     if n == 1 :3.         return True4.     elif n % 2 == 1 :5.         return False6.     else :7.         return powerOfTwo(n / 2) What is the best interpretation of lines 2 and 3?