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 company produces a single type of product in two factories (F1, F2). The customer demands must be met on time. Monthly demands for the product, manufacturing and holding costs, and production capacities are shown in the table below. Demand Holding cost Manufacturing cost ($/unit) Production capacity (units) Month (units) (S/unit/month) Factory 1 (F1) Factory 2 (F2) Factory 1 (F1) Factory 2 (F2) M1 65 0.26 6.3 8.3 55 M2 50 0.15 7.1 8.5 37 38 25 At the beginning of month 1, the company has 20 units of the product in inventory. For the decision variables, assume that i shows the factory (1, 2), t shows the month (1, 2), xit is the quantity produced in factory i in month t, it is the inventory left over at the end of month t. We would like to minimize the total cost during two months (M1, M2) for this problem using an integer program. Fill the below boxes accordingly. x11+ X21+ x12+ x22+ 11+ 12 (Objective & Objective Function) s.t. x11+ X21+ x12+ X22+ 11+ 12 C (F1 capacity in M1) X11+ X21+ X12+ X22+ 11+ 12 X22+ 11+ 12 (F2 capacity in M1) M2 50 0.15 7.1 8.5 37 38 At the beginning of month 1, the company has 20 units of the product in inventory. For the decision variables, assume that i shows the factory (1, 2), t shows the month (1.2), Xit is the quantity produced in factory i in month t. It is the inventory left over at the end of month t. We would like to minimize the total cost during two months (M1, M2) for this problem using an integer program. Fill the below boxes accordingly. X11+ X21+ x12+ X22+ 12 (Objective & Objective Function) s.t. x11+ X21+ X12+ x22+ 12