input: Write a python function to generate a list of the first N prime numbers.
  assert generatePrimeNumbers(10) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert generatePrimeNumbers(5) == [2, 3, 5, 7, 11]
  assert generatePrimeNumbers(1) == [2]
output: def generatePrimeNumbers(N):
      if N <= 0:
          return []
      primes = []
      num = 2
      while len(primes) < N:
          for p in primes:
              if num % p == 0:
                  break
          else:
              primes.append(num)
          num += 1
      return primes