In the SET-COVER problem, we are given a set of elements, {1, 2, ..., m}, called the universe, and a set S of n sets whose union equals the universe. We are also given an integer, k, and asked if there is a collection of k sets in S such that the union of the sets in this collection equals the universe. Show that SET-COVER is NP-complete.