(a) The hitting set problem is as follows. Given a collection C of subsets of a set S and a positive integer k, does S contain a hitting set for C of size k or smaller, that is, a subset S' CS with |S'] = k such that S' contains at least one element from each subset in C? Prove that the hitting set problem is NP-complete