input: Write a function to compute the nth element in the Fibonacci sequence. The Fibonacci sequence is defined such that each number is the sum of the two preceding ones, starting from 0 and 1. If the input is 0, return 0. If the input is 1, return 1. For inputs greater than 1, return the sum of the two preceding elements in the 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(2)==1
  assert fibonacci_seq(3)==2
  assert fibonacci_seq(4)==3
  assert fibonacci_seq(5)==5
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)