please solve the complete question

Question 2. A baker must load W cupcakes into n empty boxes. Let {p1,p2,,pn} represent the number of cupcakes that can fit in each box (size). 1.Describe a greedy algorithm that, given W and {p1,p2,,pn}, determines the smallest number of boxes required for cupcake packaging. Demonstrate that your algorithm is correct. 2.How do you modify your algorithm if each box also has an associated cosci, and you wish to reduce the overall cost of the bottles used to hold all of the cupcakes