input: Write a python function to return a list of prime numbers within a given range.
  assert get_primes(10, 25) == [11, 13, 17, 19, 23]
  assert get_primes(30, 50) == [31, 37, 41, 43, 47]
  assert get_primes(1, 10) == [2, 3, 5, 7]
output: def get_primes(start, end):
      def is_prime(n):
          if n <= 1:
              return False
          if n == 2:
              return True
          if n % 2 == 0:
              return False
          p = 3
          while p * p <= n:
              if n % p == 0:
                  return False
              p += 2
          return True
  
      primes = []
      for num in range(start, end + 1):
          if is_prime(num):
              primes.append(num)
      return primes