7-33 The computer output given below is for Problem 7-31. Use this to answer the following questions.

(a) How much could the profit on X increase or de-crease without changing the values of X and Y in the optimal solution?

(b) If the right-hand side of constraint 1 were in-creased by 1 unit, how much would the profit increase?

(c) If the right-hand side of constraint 1 were in-creased by 10 units, how much would the profit increase?

PLEASE PROVIDE A STEP BY STEP EXPLANATION ON HOW YOU GET EACH ANSWER. Thank you!

(6). Linear Programming Results

Linear Programming Results Problem 33 Solution X Y RHS Dual X Maximize 5 6 const 1 2 1 => 120 0.75 const 2 2 3 30 60 510 Ranging Problem 33 Solution Variable Value Reduced Cost Original Val Lower Bound Upper Bound X 30 0 5 4 12 Y 60 0 6 2.5 7.5 Constraint Dual Value Slack/Surplus Original Val Lower Bound Upper Bound const 1 0.75 0 120 80 240 const 2 1.75 0 240 120 360