input: Write a function to generate the nth term of the Fibonacci sequence using recursion. If n is 0, the function should return 0; if n is 1, it should return 1; for any other value of n, it should return the sum of the (n-1)th and (n-2)th terms of the Fibonacci sequence.
  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
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)