I want Code in Python Language

4. The Fibonacci sequence is a sequence where the ith term is computed using the previous two terms such that S. S-1 + S-2 and where So = 0 and Si = 1. Write a recursive function called fib that takes in an integer i and computes S. [25 marks) Make sure you use recursion for the computation. An iterative solution will result in docked marks. Sample input: 10 Sample output: 55