Problem 4 (20pts). Consider a linear optimization problem in the standard form, described in terms of the following initial tableau (Table 2): Table 1 The entries ,,,, and in the tableau are unknown parameters, and B={2,3,1}. For each of the following statements, find (sufficient) conditions of the parameter values that will make the statement true. 1. This is an acceptable initial tableau (i.e., the basic variables are feasible for the problem). 2. The first row (in the constraint) indicates that the problem is infeasible. 3. The basic solution is feasible but we have not reached an optimal basic set B. 4. The basic solution is feasible and the first simplex iteration indicates that the problem is unbounded. 5. The basic solution is feasible, x6 is a candidate for entering B, and when we choose x6 as the entering basis, x3 leaves B