Learn Python

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……. In mathematical terms, the sequence Fn of Fibonacci num bers is defined by the recurrence relation Fn = Fn-1 + Fn-2 with seed values F0 = 0 and F1 =  1 Give a number n, print n-th Fibonacci Number. Input:     n = 2 Output:  1 Input:     n = 7 Output:  13 Write a function int fib(int n) that returns Fn. For example, if n = 0, then fib() should return 0. If n= 1, then it should return 1. For n > 1, it should return Fn-1 + Fn-2. Program: Method -1 (Use recursion) # Function for nth Fibonacci number def Fibonacci(n):      if n< 0 :          print ( "Incorrect input" )      # First Fibonacci number is 0      elif n = = 1 :       ...