3. 7-33 The computer output given below is for Problem /-31. Use this to answer the following questions. iat Linear Programming Results Problem 33 Solution Y RHS Dual Maximize NNU 120 0.75 const 2 60 510 Ranging Q X Problem 33 Solution Variable Value Reduced Cost Original Val Lower Bound Upper Bound 30 5 12 60 0 6 2.5 7.5 Constraint Dual Value Slack/Surplus Original Val Lower Bound Upper Bound const 1 120 240 const 2 1.75 0 240 360 7.5-11 Full Alternative Text How much could the profit on X increase or decrease without changing the values of X and Y in the optimal solution? b. If the right-hand side of constraint 1 were increased by 1 unit, how much would the profit increase