An objective function is a mathematical expression in linear programming that maximizes or minimizes some quantity (often profit or cost, but any goal may be used). Objective function: Maximize Z = $9 X, + $7 X2 + $15 X3 Constraints are restrictions that limit the degree to which a manager can pursue an objective. Subject to: - (packing material) 2X4+1X2+3 X3 S 130 2X+6 X2 +4 X3 = 240 X4, X2, X3 20 (packing time) 2 2 Leach Distributors packages and distributes industrial supplies. A standard shipment can be packaged in a class A container, a class K container, or a class T container. A single class A container yields a profit of $6; a class K container, a profit of $10; and a class T container, a profit of $8. Each shipment prepared requires a certain amount of packing material and a certain amount of time. Formulate and solve this problem using LP software, Resources Needed per Standard Shipment Class of Container Packing Material Packing Time (pounds) (hours) A 1 6 T 3 4 Total amount of resource available per week 180 pounds 240 hours Hugh Leach, head of the firm, must decide the optimal number of each class of container to pack each week. He is bound by the previously mentioned resource restrictions but also decides that he must keep his 6 full-time packers employed all 240 hours (6 workers * 40 hours) each week The optimal solution obtained by solving using LP software: Number of class A containers to be used =(round your response to two decimal places). K