input: Write a python function to print all prime numbers in a given range.
  assert get_prime_numbers(15, 25) == [17, 19, 23]
  assert get_prime_numbers(10, 20) == [11, 13, 17, 19]
  assert get_prime_numbers(30, 40) == [31, 37]
output: def get_prime_numbers(start, end):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
  
      return [num for num in range(start, end + 1) if is_prime(num)]