input: Write a python function to get prime numbers from a list.
  assert get_primes([2, 3, 4, 5, 6, 7, 8, 9]) == [2, 3, 5, 7]
  assert get_primes([10, 11, 12, 13, 14, 15]) == [11, 13]
  assert get_primes([17, 19, 22, 23, 24]) == [17, 19, 23]
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)]