I've watched multiple videos and read articles about recursion but I'm still confused. I've got this problem here but I'm unsure how to answer it:
The following function calculates $x^n$ recursively. How many multiplications does the function make to calculate
def exp_rec(x, n): if n==1: return x else: p = exp_rec(n, x-1) return x*p
Could someone help explain?