Consider the following LP problem and its optimal final tableau shown below: (LP): max z = 2x1 + x2-x3 Basic x1 x2 x3 x4 x5 RHS Z 0 3 xl 1 2 1 x5 0 3 -1 x4 and x5 are slack variables in the 1".., and 2nd constraints respectively, a) Fill out the empty cells in the given optimal simplex tableau. b) What is the optimality range for c, ? c) What is the feasibility range for b ? d) If the coefficient of x2 in the objective function is changed from 1 to 3, calculate the corresponding changes, detemine whether the current optimum is changed? s.t. x1 +2x2 + x3 8 -x1 + x2-2x3 4 x1, x2, x320 1 1 0 1