input: Write a function to generate a Fibonacci sequence of the first n numbers. The function should return a list containing the sequence. If n is less than or equal to 0, the function should return an empty list.
  def generate_fibonacci_sequence(n):
      if n <= 0:
          return []
      sequence = [0, 1] if n > 1 else [0]
      while len(sequence) < n:
          sequence.append(sequence[-1] + sequence[-2])
      return sequence[:n]
  
  n = 10
  print(generate_fibonacci_sequence(n))
output: def generate_fibonacci_sequence(n):
      if n <= 0:
          return []
      sequence = [0, 1] if n > 1 else [0]
      while len(sequence) < n:
          sequence.append(sequence[-1] + sequence[-2])
      return sequence[:n]