Consider the following linear programing problem: Maximize Z=200X1 + 200X2 Subject to: 2X1+4X2 0 When we solve the problem using the Simplex Method in tabular form, we get the final optimal solution tableau: $200 $200 $0 SO SOLUTION Mix x X S, S, 0.6 1 0 -0.2 $200 200 QUANTITY 3 2 $1,000 0 1 -0.2 X X2 Z C-2 0.4 $80 $40 $200 $200 0 0 -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