Exercise 6 (2 pts). Consider the following decision problem: Given a set S of integers, determine whether there exists a prime number that divides at least two integers from S. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is "yes", briefly describe a polynomial-time algorithm )