[6.8] The following simplex tableau shows the optimal solution of a linear programming problem. It is known that x4 and x5 are the slack variables in the first and second constraints of the original problem. The constraints are of the < type. Z x₁ x2 хз X4 x5 RHS Z 1 0 -2 0 4 -2 -35 X3 0 0 1/4 T 1/4 0 5/2 Χ 0 1 -1/2 0 -1/6 1/3 2 a. Write the original problem. b. What is the dual of the original problem? C. Obtain the optimal solution of the dual problem from the tableau.