Consider the following linear program, which maximizes profit for two products: regular (R) and super (S): MAX SR + 75S s.t. 1.2 R+ 1.6 5 3 600 assembly (hours) 0.8 R + 0.5 S = 0 See the sensitivity report provided below: See the sensitivity report provided below: Variable Cells Final Reduced Objective Allowable Allowable Value Goefflclent Increase Decrease 0 $C$28 Regular - R $C$29 Super - S 0 Constraints Final Shadow Constraint Allowable Allowable Value R.H. Side IncreaseDegrease 0 $F$6 assembly (hours) $F$7 paint (hours) $F$8 inspection (hours) 15-30 100 The lower limit of the super product (S) objective function coefficient (profit of S) is Please choose the option that best fit the empty space above. 10.8 0 120 O 12.5 0 It is "infinity", so there is no lower limit. 0 None of the above