What changes when you ask one person and wait instead of doing all the bookkeeping yourself — and how does that recipe write power_recur almost line for line?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
Here is the finished function from the video:
def power_recur(n, p): if p == 0: return 1 elif p == 1: return n else: return n * power_recur(n, p - 1)
Trace power_recur(3, 5) on paper. Counting the very first call itself, how many separate calls to power_recur are made in total before the final answer comes back? Assign that whole number to num_calls.