Close Windo A Moving to another question will save this response. Question 2 of 4 Question 2 28 points Save An Consider the following linear program: Minimize Z = 3x1 + 2x2 Subject to 2x1 + x2 2 10 3x1 - 2x2 2-6 x1 + x2 26 *1,x220 Construct the initial tableau for the Big M method and determine whether the initial basic feasible solution of the resulting artificial problem is optimal. If not, proceed to the optimal solution through the simplex iterations, and report the optimal solution to the original LP given above. For the toolbar, press ALT F10 ( Por ALT FN.F10 (Mac). BIS Paragraph Arial 14px TE X @ Q X X