input: Write a function to generate the nth term of the Fibonacci sequence. If n is 0, return 0. If n is 1, return 1. For any other n, return the sum of the (n-1)th and (n-2)th terms of the Fibonacci sequence.
  def fibonacci_seq(n): 
      if n==0: 
          return 0
      elif n==1: 
          return 1
      else: 
          return fibonacci_seq(n-1)+fibonacci_seq(n-2)
  
  assert fibonacci_seq(0)==0
  assert fibonacci_seq(1)==1
  assert fibonacci_seq(5)==5
  assert fibonacci_seq(10)==55
  assert fibonacci_seq(20)==6765
output: def fibonacci_seq(n): 
      if n==0: 
          return 0
      elif n==1: 
          return 1
      else: 
          return fibonacci_seq(n-1)+fibonacci_seq(n-2)