Consider the following linear program, which maximizes profit for two products--regular (R) and super (S): MAX Z = 5OR + 755 s.t. 1.2 R+ 1.65 s 600 assembly (hours) 0.8 R +0.5 5 s 300 paint (hours) .16 R +0.4 S s 100 inspection (hours) Sensitivity Report: Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$7 Regular 300.21 0.00 50 70 20 $C$7 Super = 150.32 0.00 75 50 43.75 Cell Final Shadow Constraint Allowable Allowable Name Value Price R.H. Side Increase Decrease $E$3 Assembly (hr/unit) 563.33 33.33 600 1E+30 36.67 $E$4 Paint (hr/unit) 300.00 0.00 300 39.29 175 $E$5 Inspect (hr/unit) 100.00 145.83 100 12.94 40 The optimal number of regular products to produce is 300.21 and the optimal number of super products to produce is 150.32 for total profits of 26284.5 (Please round the result to two decimals)