input: Write a python function to find prime numbers in a given range and return them as a list.
  assert getPrimeNumbersInRange(30, 50) == [31, 37, 41, 43, 47]
  assert getPrimeNumbersInRange(10, 20) == [11, 13, 17, 19]
  assert getPrimeNumbersInRange(50, 60) == [53, 59]
output: def getPrimeNumbersInRange(start, end):
      def is_prime(n):
          if n <= 1:
              return False
          if n == 2:
              return True
          if n % 2 == 0:
              return False
          for i in range(3, int(n**0.5) + 1, 2):
              if n % i == 0:
                  return False
          return True
  
      return [num for num in range(start, end + 1) if is_prime(num)]