Algorithm and Complexity, Python

def expt(b, n):

if n == 0:

return 1

else:

return b*expt(b, n-1)

def expt(b, n): if n == 0: return 1 else: return b*expt(b, n-1) [ ] expt(2, 3) 8 # Task 1a). What is the complexity of the procedure? # b. The procedure 'expt' is an example of the recursive process. Can you work out an iterative process doing the same as expt?||