Question 1. (30 points) Definition: Bin Packing Prohlem Inpuk: A finite set U of items, a sire s(u)Z for each uU, and a positive inheger bin cupocity in. Task: Allecate all the items into a manimum number of bins. socti thal the bin eapaciues are wol exceeded. Sample instance and alternative feasible solutions Items a) Design a simple construction hewistic in detail in plain English. (15 points) heuristic in part (a). (15 pointh) genenser Bin packing Problem. Explain your heuribic