input: Write a python function to get the first 'n' prime numbers.
  assert get_first_prime_numbers(5) == [2, 3, 5, 7, 11]
  assert get_first_prime_numbers(10) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert get_first_prime_numbers(15) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
output: def get_first_prime_numbers(n):
      def is_prime(num):
          if num < 2:
              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