+20 points-Part A) 10 points, part B) 10 points 5.1-4. Consider the following problem. Maximize Z=2x-x2+x3. subject to 3x1 + x2 + x360 x1x2 +213 ≤ 10 and x1 + x2 x ≤ 20 J≥0 1½≥0. After slack variables are introduced and then one complete itera- tion of the simplex method is performed, the following simplex tableau is obtained. Iteration 1 Basic Variable Eq. Z (0) X4 4242 x1 (1) (2) x (3) Coefficient of: Right Side N x1 X2 -1 1412 0100 1001 4 -5 3523 -1 -3 0010 2 -3 1 -1 1000 20 30 10 10 (a) Identify the CPF solution obtained at iteration 1. (b) Identify the constraint boundary equations that define this CPF solution.