input: Write a function that computes the nth term of the Fibonacci sequence. If the input n is 0, the function should return 0, if n is 1, the function should return 1, and for any other value of n, the function should return the sum of the two preceding terms.
  
  `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(3)==2
  assert fibonacci_seq(5)==5
  assert fibonacci_seq(7)==13
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)
  