While a linear programming model is solved with the two-stage simplex method, in one step of the first stage, The following table was obtained: W 1 0 0 0 0 X1 0 0 0 1 0 0 0 1 0 0 X3 3 -2.8 0.4 2.2 3 $1 e 0 1 1 0.8 0 0 0 -0.4 -0.2 1 e4 -1 0 0 0 -1 az -2 -0.8 0.4 -0.2 0.4 1 0.2 -1 a3 0 -0.6 a. The objective function of the linear programming model: b. The objective function of the linear programming model: a4 0 0 0 0 1 ST 45 29 3 4 45 Starting from the table above, solve the linear programming model with the two-stage simplex method according to the following situations: Max Z = 4x2x + x3 Min Z= 4x - 2x + x3