6. Find the basic and basic feasible solutions of a linear programming problem whose con- straints are 1 8 =i - 8 - 21 4 1 2l=]9}, 2 >0 B 1 =1 2 = 1 T3 T4 T4 The region described by these constraints is bounded (you don't have to prove that, but if you're bored, satisfy yourself that it's true). Given that fact, what is the maximum value of z = 2x1 + x3 on the region? 7. Consider the linear programming problem whose constraints are X1 T 2 31 00 T2 1 T -1 10 21 zs | =111 [, 3 | >0 0 6 1 0 3 T4 4 T4