input: Write a Python function to return a list of prime numbers within a given range.
  assert get_primes(2, 10) == [2, 3, 5, 7]
  assert get_primes(11, 20) == [11, 13, 17, 19]
  assert get_primes(1, 5) == [2, 3, 5]
output: def get_primes(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 [x for x in range(start, end + 1) if is_prime(x)]