input: Write a function to generate and print the first n numbers in the Fibonacci sequence. The Fibonacci sequence is defined as follows: the first number is 0, the second number is 1, and each subsequent number is the sum of the previous two numbers.
  
  def generate_fibonacci(n):
      if n <= 0:
          return
      elif n == 1:
          print(0)
          return
      elif n == 2:
          print(0)
          print(1)
          return
      a, b = 0, 1
      print(a)
      print(b)
      for _ in range(2, n):
          c = a + b
          print(c)
          a, b = b, c
  
  
  assert generate_fibonacci(0) == None
  assert generate_fibonacci(1) == None
  assert generate_fibonacci(2) == None
  assert generate_fibonacci(5) == None
output: def generate_fibonacci(n):
      if n <= 0:
          return
      elif n == 1:
          print(0)
          return
      elif n == 2:
          print(0)
          print(1)
          return
      a, b = 0, 1
      print(a)
      print(b)
      for _ in range(2, n):
          c = a + b
          print(c)
          a, b = b, c