2. (3 points) Either prove that the following problem is NP-complete or show that it belongs to P: - Input: An undirected graph G = ( V , E ) and two positive integers s , t N . - Question: Is there a subset S V such that S = s and there are at most t edges between the vertices in S ?.