Considering the following linear programming problem.

Consider the following linear programming problem. Maximize Subject to: -5x1 +5x2 +13.33 -11 +32 +3x3 = 20 1201 +4.x2 +10x3 0. The initial and final Simplex Tableaus for solving this problem are given below. Initial Tableau: 2 $1 S2 Basic 21 Variable 15 81 0 -1 0 12 22 23 -5 -13 1 3 4 10 0 0 0 1 0 20 0 1 90 S2 Final Tableau: z 81 5 Basic 11 Variable 1 0 0-1 0 16 12 S2 22 0 1 0 13 2 3 -2 NWN S2 0 100 0 20 1 10 1 -4 A) For what ranges of the change in the RHS of both constraints (one at a time), the current optimal basis remins optimal? B) For what range of the change in the coefficient of xz in the objective function, the current optimal basis remins optimal? C) c Introduce a new variable X4 with C4 = 10 (the coefficient in the objective function), a 14 = 3, and a24 = 5 (the coefficients in the constraints). Find the new optimal solution of the problem. Consider the following linear programming problem. Maximize Subject to: -5x1 +5x2 +13.33 -11 +32 +3x3 = 20 1201 +4.x2 +10x3 0. The initial and final Simplex Tableaus for solving this problem are given below. Initial Tableau: 2 $1 S2 Basic 21 Variable 15 81 0 -1 0 12 22 23 -5 -13 1 3 4 10 0 0 0 1 0 20 0 1 90 S2 Final Tableau: z 81 5 Basic 11 Variable 1 0 0-1 0 16 12 S2 22 0 1 0 13 2 3 -2 NWN S2 0 100 0 20 1 10 1 -4 A) For what ranges of the change in the RHS of both constraints (one at a time), the current optimal basis remins optimal? B) For what range of the change in the coefficient of xz in the objective function, the current optimal basis remins optimal? C) c Introduce a new variable X4 with C4 = 10 (the coefficient in the objective function), a 14 = 3, and a24 = 5 (the coefficients in the constraints). Find the new optimal solution of the