input: Write a function to recursively calculate the Fibonacci numbers up to a given number \( n \). If \( n \) is 0, return 0. If \( n \) is 1, return 1. For any other value of \( n \), return the sum of the Fibonacci number for \( n-1 \) and \( n-2 \).
  def Fibonacci(n): 
      if n==0: 
          return 0
      if n==1: 
          return 1
      else: 
          return Fibonacci(n-1)+Fibonacci(n-2)
  assert Fibonacci(0)==0
  assert Fibonacci(1)==1
  assert Fibonacci(2)==1
  assert Fibonacci(3)==2
  assert Fibonacci(4)==3
  assert Fibonacci(5)==5
output: def Fibonacci(n): 
      if n==0: 
          return 0
      if n==1: 
          return 1
      else: 
          return Fibonacci(n-1)+Fibonacci(n-2)