Remarks & Instructions: 1. Do not scale any coefficient or function. All coefficients must be numeric values. 2. Right-hand side of each constraint should be a nonnegative numeric value. 3. Do not put any spaces, extra characters or explanations since these may render your answer incorrect. 4. An empty box is considered incorrect and receives zero point. A store buys laptop bags from two manufacturers and sells them online. The store wants to determine the quantity of bags to buy from each manufacturer (x1 and x2) in the cheapest way using an LP. Received bags may contain defects, and those cannot be sold to customers. The store inspects the bags and gets defectives repaired, but both operations take time. Therefore, at least 60% of the bags received must be defect free. The store has to buy at least some minimum quantity from each manufacturer and a total of exactly 950 bags. See below for other data. Fill the below boxes accordingly. Manufacturer 1 Manufacturer 2|Available Purchase cost ($unit) 9.6 Repair cost ($/unit) 2 Defective rate (%) 20 Inspection time (hour unit) 0.03 0.01 45 hours Repair time (hour/unit) 0.2 Minimum order size (units) 10.9 1 10 0.4 68 hours 220 310 x1 + x2 (Objective & Objective Function) St. x1 + X2 > (Purchase quantity constraint) X1 + X2 (Defect-free quantity constraint) (Inspection time constraint) x1 + x2