consider the following linear program, which maximizes profit for two products--regular (R) and super (S): MAX Z=50R + 75S s.t. 1.2 R+ 1.6 S s 600 assembly (hours) 0.8 R+ 0.5 S s 300 paint (hours) .16 R +0.4 S s 100 inspection (hours) Sensitivity Report: Cell Name Final Value Reduced Cost Objective Coefficient Allowable Increase Allowable Decrease $B$7 300.21 0.00 50 70 20 Regular = Super = $C$7 150.32 0.00 75 50 43.75 Cell Name Final Value Shadow Price Constraint R.H. Side Allowable Increase Allowable Decrease $E$3 563.33 33.33 600 1E+30 36.67 $E$4 Assembly (hr/ unit) Paint (hr/unit) Inspect (hr/ unit) 300.00 0.00 300 39.29 175 $E$5 100.00 145.83 100 12.94 40 without affecting the product mix. The profit on the regular product could increase by Group of answer choices The profit on the regular product could increase by Group of answer choices without affecting the product mix. 60 100 80 92