For python programming, please assist with b.

Question 2. The factorial function informally is n! = 1 x 2 x 3 x ... X n. For example, 5! = 1 x 2 x 3 x 4 x 5 = 120. A recursive definition of the factorial function is: n! = n x (n-1)! for n 1, and n! = 1 for n=0. a) (15 points) Complete the following recursive function for factorial(n). def factorial(n): if n= 0: return 1 else: return n*factorial (n-1) b) (5 points) Would you expect your recursive factorial function to slow like therecursive Fibenassi function? (Justify your answer)