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