input: Write a python function to return a list of prime numbers from a given list.
  assert get_primes([2, 3, 4, 5, 6, 7, 8, 9, 10]) == [2, 3, 5, 7]
  assert get_primes([11, 13, 15, 17, 19, 21, 23]) == [11, 13, 17, 19, 23]
  assert get_primes([24, 25, 26, 27, 28, 29, 30]) == [29]
output: def get_primes(numbers):
      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 [num for num in numbers if is_prime(num)]