Consider the following linear programing problem: Maximize Z=200X, +200X2 Subject to: 2X, + 4X2 X: + 3X: 39 X,X > 0 S8 When we solve the problem using the Simplex Method in tabular form, we get the final optimal solution tableau: $200 $200 SO SOLUTION Mix X QUANIM $200 1 0.6 -0.2 3 200 X 1 2 $200 $200 $80 $40 $1,000 C; 2; -40 0 0 -0.2 0.4 2 0 0 -80 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! c) If the right-hand side of constraint I 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 X