Let's assume that you are worker at a bottled water company named Trojan Waters which supplied water bottles to the greenhouse in problem-2. At the facility, there is a water filter (completely filled with water) which has a capacity of W (in L), and there are n different empty bottles of capacities p1,p2,pn. Your job as a loyal worker is to design a greedy algorithm, which, given W and p1,p2,,pn, determine the fewest number of bottles needed to store the entire water W. Prove that your algorithm is correct