Draw the recursion trace for the computation of power(2,5), using the traditional function implemented in Code Fragment

def power(x, n): Compute the value x n for integer n. if n == 0:

return 1 else:

return x power(x, n1)

111111 1 def power(x, n): 2 Compute the value ***n for integer n.' 3 if n == 0: 4. return 1 5 else: 6 return x * power(x, n-1)