Consider the following problem Maximize subject to Z=2x+7x2-3x3, x1 + 3x2 + 4x3 30 x14x2 x3 10 and X = 0, 0. X3 0. By letting x4 and xs be the slack variables for the respective constraints, the simplex method yields the following final simplex table: Z % X2 X X4 x5 RHS Z 1 0 1 1 0 2 20 0 0 -1 5 1 -1 20 % 0 1 A -1 0 1 10 For each change, use the sensitivity analysis procedure to test this solution for feasibility and for optimality. a) (25p) Change the right-hand sides to b) (40p) Change the coefficients of x, to c) (35p) Introduce a new variable with X6 2-9 coefficients a CO