asap

Consider the following linear programming problem: Maximize = r + 2 + 214 subject to 32 + 12 + 3x3 + 2x4 = 10 1 - 312 + 2.13 5 7 + 2.02 + 3.13 + 14 4 2, 20, j = 1, 2, 3, 4. (a) (6 points) State the dual problem. (b) (14 points) In order to find optimal solutions to both the primal and dual problem, the following two tableaux for the primal problem were obtained: (25,26 are slack variables; 91:32 are artificial variables.) Initial tableau of Phase 1: 21 12 13 14 15 16 11 12 913 1 3 2 0 0 1 0 10 351 -3 2 0 1 0 0 0 7 121 2 3 1 0 1 0 1 -4 -3 -6 -3 0 1 0 0 -14 31 26 5 25 10 293 2 Final tablean of Phase 2: 32 33 34 35 36 31 0 3 3 0 1 2 0 11 6 1 0 3 1 3 2 0 0 1 0 3 0 0 1 32 -1 0 0 0 16 37 10 10 Find an optimal solution to the dual problem, by using the above two tableaux