Consider the following linear program, which maximizes daily total profit for two products, regular (R), and super (S):

MAX Z = 50R + 75S

s.t.

1.2R + 1.6 S 600 assembly (hours)

0.8R + 0.5 S 300 paint (hours)

0.6R + 0.4 S 200 inspection (hours)

R, S 0

Implement the LP problem in a spreadsheet model and invoke Solver to obtain the optimal solution. Use labels and formatting to enhance readability of model and Solver reports.

a. Create spreadsheet model and paste an screenshot of spreadsheet model. Use "=FORMULATEXT" to show formulas in the model

b. Invoke Solver to find optimal solution. Paste screenshots of the Answer Report and Sensitivity Report.

c. What is the optimal solution?

d. What is the maximum daily profit?

e. What resources are being completely exhausted to achieve the maximum profit?