Consider the following linear programming problem, which maximizes profit for two products: regular (R) and super (S): MAX 5R + 755 s.t. 1.2 R+ 1.6 S S 600 assembly (hours) 0.8 R + 0.5 S s 300 paint (hours) 0.16 R +0.4 S = 0 See the sensitivity report provided below: See the sensitivity report provided below: Variable Cells Final Reduced Objective Allowable Allowable Value Coefficient Increased $C$28 Regular - R $C$29 Super - S 0 Constraints Final Shadow Constraint Allowable Allowable Value R.H. Side Increase Decrease Name 600 $F$6 assembly (hours) $F$7 paint (hours $F$8 inspection (hours) 0 300 100 The upper limit of the regular product (R) objective function coefficient (profit of R) is _________ Please choose the option that best fit the empty space above. O 120 O 20 O 40 O 70 0 None of the above