The simplex tableau below is an intermediate step resulted from solving a linear programming problem using simplex method. Iteration 1: Z x1 x2 x3 sl s2 $3 constant 1 0 -2 -1 0 0 3 15 0 0 1 2 0 1 -6 10 0 0 (2) 4 1 0 -8 8 0 1 0 0 0 0 1 4 (1) What is the current basic feasible solution? Is the current solution optimal, why? (5 points) X₁ = 4 S₁₁ = 8 S₂ = 10 No, it is not optimal, because there are ways to further improve, parameters in row 。 being negative.