Consider the following linear programing problem: Maximize 2-200X: +200X Subject to: 2X, + 4X, S8 X+ 3x3 S9 X. X: 20 When we solve the problem using the Simplex Method in tabular form, we get the final optimal solution tableau: 50 SI S OVATED 5200 $200 SOLUTION MIN 3 N X 1 0 x 0 1 2 $200 $200 0 0 0.6 $200 200 3 0.2 0.44 -0.2 2 580 $40 $1,000 -80 40 Use the above optimal solution tableau to answer the following questions: a) What are the shadow prices for the two constraints? b) Perform RHS ranging for constraint 1 c) If the right-hand side of constraint 1 were increased by 5, what would the maximum possible profit be? Give the values for all the variables. d) Find the range of optimality for the profit on X1