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