input: def fibonacci_seq(n: int) -> int:
      """Calculate the nth Fibonacci number using recursion.
      The Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum 
      of the previous two numbers.
      
      >>> fibonacci_seq(0)
      0
      >>> fibonacci_seq(1)
      1
      >>> fibonacci_seq(5)
      5
      >>> fibonacci_seq(10)
      55
      """
      if n==0: 
          return 0
      elif n==1: 
          return 1
      else: 
          return fibonacci_seq(n-1)+fibonacci_seq(n-2)
output:     if n == 0:
          return 0
      elif n == 1:
          return 1
      else:
          return fibonacci_seq(n - 1) + fibonacci_seq(n - 2)