input: Write a python function to filter prime numbers from a list.
  assert filter_primes([2, 3, 4, 5, 6, 7, 8, 9, 11]) == [2, 3, 5, 7, 11]
  assert filter_primes([10, 13, 17, 19, 23, 24, 25]) == [13, 17, 19, 23]
  assert filter_primes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]) == [2, 3, 5, 7, 11]
output: def filter_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)]