Consider a linear programming problem in standard form, described in terms of the following initial tableau: δ3γξ β010α103 2 0 0 1 −2 2 η −1 3 1 0 0 0 −1 2 1 the entries matrix corresponding to having x2, x3, and x1 (in that order) be the basic variables. for each one of the following statements, find the ranges of values of the various parameters that will make the statement to be true. (a) (1 point) phase ii of the simplex method can be applied using this as an initial tableau. (b) (1 point) the first row in the present tableau (below the row with the reduced costs) indicates that the problem is infeasible. (c) (1 point) the corresponding basic solution is feasible, but we do not have an optimal basis. (d) (1 point) the corresponding basic solution is feasible and the first simplex iteration indicates that the optimal cost is −[infinity]. (e) (1 point) the corresponding basic solution is feasible, x6 is a candidate for entering the basis, and when x6 is the entering variable, x3 leaves the basis. (f) (1 point) the corresponding basic solution is feasible, x7 is a candidate for entering the basis, but if it does, the solution and the objective value remain unchanged.