Can you complete with same this python code. and can you send me the code which I can copy and paste, please? thank you.

Recursion!

In this exercise, you will write two recursive functions, one to calculate n! (n factorial) and one to calculate the Fibonacci numbers. The factorial of a positive integer (n!) is the product of that number times all integers less than it and greater than 0. For example, 4! = 4 * 3 * 2 * 1 = 24 and 5! = 5 * 4 * 3 * 2 * 1 = 120. Hint: n! = n * (n-1)! The Fibonacci numbers are a sequence of numbers obtained by summing the two previous numbers in the series. That is, fib(n) = fib(n-1) + fib(n-2), with the base cases of fib(0) = 0 and fib(1) = 1. Expected behavior: factorial(1) == 1 factorial(4) == 24 factorial(6) == 720 factorial(10) == 3628800 fib(0) == 0 fib(1) == 1 fib(6) == 8 fib(16) == 987 fib(20) == 6765

def factorial(n): """Recursively calculate n!""" # Your code here

def fib(n): """Recursively calculate the nth Fibonacci number.""" # Your code here