A linear programming model is given as follows: Minimize Z= 5.2x + 2.5x + 6.0x3 Subject to 3x + 2x + 2x3 2 200 X 20.4 iii. iv. V. x + x + x3 x + x3 2x1 - 0.2 x = x + x3 X1, X2, X3 20 (a) Solve the problem by using the computer. What are the minimum Z and the optimal point? (b) Obtain the values of the slack/surplus variables at the optimal solution in (a) (c) Identify the sensitivity range of the objective function coefficient of x. (d) Identify the sensitivity range of the value of the 1* resource constraint (right-hand side). (e) Identify the sensitivity range of the value of the 3rd resource constraint (right-hand side). (f) which of the following makes the model infeasible? (Choose one) i. ii. Increase of the coefficient of x, on the objective function to 2000 Decrease of the coefficient of x, on the 1st constraint to -5 Addition of a new constraint, x + 2x + 3x3 100 Removal of the non-negativity constraints for X, X2, X3 None