Formulate but do not solve the following exercise as a linear programming problem. A company manufactures x units of Product A and y units of Product B, on two machines, I and II. It has been determined that the company will realize a profit of $3 on each unit of Product A and $4 on each unit of Product B. To manufacture a unit of Product A requires 5 min on Machine I and 3 min on Machine II. To manufacture a unit of Product requires 9 min on Machine I and 4 min on Machine II. There are 311 min available on Machine I and 153 min available on Machine II in each work shift. How many units of a product should be produced in each shift to maximize the company's profit P in dollars? Maximize subject to the constraints Machine I Machine IT x 20 y20 [-/2 Points] DETAILS TANFIN12 3.2.003. MY NOTES ASK YOUR TEACHER Formulate but do not solve the following exercise as a linear programming problem. Kane Manufacturing has a division that produces two models of fireplace grates, x units of model A and y units of model B. To produce each model A requires 2 lb of cast iron and 6 min of labor. To produce each model B grate requires 5 lb of cast iron and 5 min of labor. The profit for each model A grate is $1.50, and the profit for each model B grate is $1.00. IF 1700 lb of cast iron and 1500 min of labor are available for the production of grates per day, how many grates of each model should the division produce per day to maximize kane's profits Pin dollars? Maximize P = subject to the constraints cast iron labor x 20 y20