input: Write a function to display the first n numbers in the Fibonacci sequence. If n is less than or equal to 0, return an empty list. 
  def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          seq = [0, 1]
          for i in range(2, n):
              seq.append(seq[-1] + seq[-2])
          return seq
  
  assert Fibonacci(0) == []
  assert Fibonacci(1) == [0]
  assert Fibonacci(2) == [0, 1]
  assert Fibonacci(5) == [0, 1, 1, 2, 3]
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
output: def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          seq = [0, 1]
          for i in range(2, n):
              seq.append(seq[-1] + seq[-2])
          return seq