6. Prove that the following problem is NP-Complete. Given positive integers k, n and a list of sets S1, S2,… , Sm 1,2, ., n). decide if there exists a set CC 1,2,…, m such that l Cl = k and Sîn Sj = 0 for all i, j E C with J. 8. Recall the definition of Vertex-Cover = {(G, k): G is a graph that has a vertex cover of
OR
OR