1. The linear program has conducted the first tableau (a complete iteration of the simplex algorithm to maximize a profit function Z) as shown below where X4, X5, and X6 are slack variables. z X1 X2 X3 X4 X5 X6 rhs (solution) 135 27.5 03/ 20 -1/2 x20 -1/2 i 3/2 X60 2 0 5 0 0 - 1/2 12 0 0 0 1 Conduct a second complete iteration of the simplex algorithm (generate next tableau) Select the most appropriate answer from the choices below. Show all work, no credit if work not shown in next page (not a guessing game). A. There is a feasible solution and the optimal profit is $260 B. There is a feasible solution and the optimal profit is $341 C. There is a feasible solution and the optimal profit is $261 D. None of the above Answer_ (place on answer sheet as well) Show all work that related to the problem 1, no credit if work not shown (not a guessing game)