Regular \& Super Consider the following linear program, which maximizes profit for two products-regular (R) and super (S): MAX50R+75S s.t. 1.2R+1.6S600 assembly (hours) 0.8R+0.5S300 paint (hours) .16R+0.4S100 inspection (hours) Solve the problem: Provide the feasible region Provide the corner points Provide the optimal value solution Provide the optima point (R,S) is paint-hours a binding constraint? is inspection-hours a binding constraint