Consider the following problem: Maximize -₁ subject to 2x₁ X1 X1, + + X2 x2 2x2 X2, + 2x3 + x3 + x4 + X4 2x3 X4 + x3, - ≥ 6 ≤ 4 X4 ≥ 0. a. Introduce slack variables and draw the requirement space. b. Interpret feasibility in the requirement space. C. You are told that an optimal solution can be obtained by having at most two positive variables while all other variables are set at zero. Utilize this statement and the requirement space to find optimal