input: Write a python function to generate the first N prime numbers.
  assert firstPrimeNumbers(5) == [2, 3, 5]
  assert firstPrimeNumbers(10) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert firstPrimeNumbers(1) == [2]
  assert firstPrimeNumbers(0) == []
output: def firstPrimeNumbers(N):
      def is_prime(n):
          if n < 2:
              return False
          for i in range(2, int(n ** 0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      primes = []
      num = 2
      while len(primes) < N:
          if is_prime(num):
              primes.append(num)
          num += 1
          
      return primes