input: Write a python function to find prime numbers within a given range.
  assert find_primes_in_range(10, 20) == [11, 13, 17, 19]
  assert find_primes_in_range(2, 5) == [2, 3, 5]
  assert find_primes_in_range(50, 60) == [53, 59]
  assert find_primes_in_range(1, 10) == [2, 3, 5, 7]
output: def find_primes_in_range(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 = [num for num in range(start, end + 1) if is_prime(num)]
      return primes