Graves Lighting is planning this week's schedule for a metal stamping machine. It has been decided that they will make several models of exterior lanterns. All necessary accessories and glass inserts are in ample supply. Model Stamping time/unit Assembly time/unit Packaging time/unit Profit/unit MX142 2.2 minutes 1.4 minutes 1 minute $3.56 QX156 2.3 minutes 2.9 minutes 1 minute $2.34 RX188 2.4 minutes 2.8 minutes 1 minute $4.09 SZ203 1.5 minutes 2.0 minutes 1 minute $2.74 Time available 2600 minutes 3400 minutes 2800 minutes Graves is committed to producing at least 500 of model SZ203. The number of RX188 should not exceed 60% of the total number of units produced. Also there should be at most two MX142 for every QX156 made. Let decision variables M, Q, R, and S respectively define the number of MX142, QX156, RX188, and SZ203 made. Which of the following models represents a linear programming problem that will allow Graves to determine the number of each model to make such that profits are maximized. 10 a Maximize Profit = 3.56M +2.34Q +4.09R +2.74S Subject to 2.2M +2.3Q + 2.4R +1.55 500 0.6R 500 R 0 c) None of the given choices d) Maximize Profit = 3.56M +2.34Q +4.09R +2.74S Subject to 2.2M + 2.3Q + 2.4R + 1.55 > 2600 1.4M + 2.9Q + 2.8R + 2.05 > 3400 1.0M +1.00 + 1.0R + 1.05 > 2800 S > 500 R 0 e) Maximize Profit = 3.56M + 2.34Q + 4.09R +2.74S Subject to 2.2M + 2.3Q + 2.4R + 1.55 > 2600 1.4M + 2.9Q + 2.8R+2.05 > 3400 1.0M +1.00 +1.0R + 1.05 > 2800 S > 500 R 0 M,Q,R,S > 0