input: Write a python function to find all prime numbers in a given list of numbers.
  assert find_primes([13, 19, 23, 5, 7]) == [13, 19, 23, 5, 7]
  assert find_primes([4, 6, 8, 10]) == []
  assert find_primes([2, 3, 5, 7, 11, 13, 17, 19, 23, 29]) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
output: def find_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)]