In the hitting set problem, we are given a family of sets {S1,S2,,Sn} and a budget b, and we wish to find a set H of size at most b which intersects every Si, if such an H exists. In other words, we want H S, for all i. Show that hitting set is NP-complete.