Please answer all 3 questions

Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 6x + 9y + 6z subject to 4x + 7y + 92 s 10 6x + 5y + z s 135 x + 4y+ 92 5 30. 52 53 first constraint second constraint third constraint objective function 5. [-/6 Points] DETAILS HARMATHAP12 4.3.007. A simplex matrix is given. 1 0 3 0 1 - 12 17 0 14 0 0 3 5 1 21_ The solution is complete, so identify the maximum value of f. F = Identify a set of values of the variables that gives this maximum value. If multiple solutions may exist, indicate this by entering MULTIPLE in each answer blank. K = VE Locate the next pivot. (If no further row operations are necessary, enter DNE.) row number of next pivot ---Select--- column number of next pivot ---Select--- next pivot number Submit Answer 6. [-/7 Points] DETAILS HARMATHAP12 4.4.007.MI. Write the dual maximization problem, and then solve both the primal and dual problems with the simplex method. (For the dual problem, use x1, X2, and x; as the variables and f as the function.) Minimize g = 4y, + 20y, subject to 2y1 + /2 2 13 y1 + 3y, 2 13 y1 + 4y, 2 18. primal g = primal Y1 primal /2 = dual f = dual X1 = dual dual X 2 =