3- The linear programming problem and its optimal table is given in the following. Min Z=-5X1+3X2-X3 X1-X2-X3=0 S2 RHS Row BVS 1 X1 2 X3 3 Z IXIN X1 1 0 0 X2 1 0 Si 0 X3 -1 2 0 lolola Oral On 0 -5 a. Fill the blanks (2 points) b. What is the range of change (A) for the objective function coefficient of X2 so the current optimal solution stays the same? (3 points) c. What is the range of change for the objective function coefficient of X1 so the current optimal solution stays the same? (3 points) d. What is the shadow price of the second constraint? Is it worth to purchase a unit of resource 2 for $0.5? (3 points) e. If we add a new variable, xt, with resource consumption vector of [125] and coefficient of 1. Does the current solution change? Explain. (3 points)