input: Write a Python function to find all prime numbers in a given range.
  assert find_prime_numbers(10, 20) == [11, 13, 17, 19]
  assert find_prime_numbers(50, 60) == [53, 59]
  assert find_prime_numbers(100, 110) == [101, 103, 107, 109]
output: def find_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
      
      primes = []
      for num in range(start, end + 1):
          if is_prime(num):
              primes.append(num)
      
      return primes