Consider the following task of building a zoo for Drexel! You've gathered m donors to fund the creation vour new park, and you've picked the location, so now you just need to choose the inhabitants. Ideally yo get every animal imaginable, except you just don't have space. As it is, you have room to comfortably s animals. Since you'd like to ensure that your funding doesn't dry up, you figure your donors should o make requests about which animals will be kept. After sending out a few emails, you collect from e lonor i a list of animals A; which donor i would like to have at the zoo. As you suspected, the total num of different animals appearing on the m lists exceeds k, so you won't be able to satisfy all of their reque You decide the fairest thing to do is to ensure that at least 1 animal from each A; is chosen. Given all these lists, we want to know whether we can select a set H of at most k animals to put in coo such that each donor i will be able to see at least one of the animals from her list A; (that is, Hn A