input: Write a function to generate Fibonacci sequence up to n terms.
  assert generateFibonacciSequence(5)==[0, 1, 1, 2, 3, 5]
  assert generateFibonacciSequence(8)==[0, 1, 1, 2, 3, 5, 8, 13, 21]
  assert generateFibonacciSequence(1)==[0, 1]
output: def generateFibonacciSequence(n):
      if n == 1:
          return [0, 1]
      sequence = [0, 1]
      while len(sequence) <= n:
          sequence.append(sequence[-1] + sequence[-2])
      return sequence