input: Write a function to generate the nth term of the Fibonacci sequence. The function should return the nth term of the Fibonacci sequence. The Fibonacci sequence starts with 0 and 1, where each subsequent number is the sum of the previous two numbers.
  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(15) == 610
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)