In Exercises 1-5 the given tableau represents a solution to a linear programming problem that satisfies the optimality criterion, but is infeasible. Use the dual simplex method to restore feasibility.
5 6 0 0 0 0 cB x1 x2 x3 x4 x5 x6 xB
5 x1 1 0 0 -1 1 0 4
6 x2 0 1 0 1 -2/3 0 10/3
0 x3 0 0 1 7 -8 0 2
0 x6 0 0 0 0 -1/3 1 -1/3
0 0 0 1 1 0 40