To your surprise, you recently discovered n baby kittens living in your backyard and they have gotten a bit out of control. Fortunately, you have a list of m people wanting to adopt different numbers of kittens. The max number of kittens they can adopt is denoted as K_i for person i. You want to make as few trips/shipments as possible. Give a greedy algorithm for finding a minimum size set S of people which can adopt all n kittens and prove its correctness.