Exercise 4 (2 pts). The triplicate detection problem is defined as follows Input: A sequence S of integers Question: Is there an integer that appears in S three or more times? Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is "yes", briefly describe a polynomial-time algorithm