Given a linear programming problem in the variables [X1 , ... , x, ] with free variables Xx = Px - me, we write the standard-form variables as a comma-separated list enclosed in square brackets: [* 1 , . . . ; Xk-1 + PK , MK: Xktl , . . . , Xns Xntly ... . Xnts] where the final s variables are the slack variables listed in the same order as their corresponding constraints in the original problem. Consider the polyhedron P in the variables x = [x] , x,] ER: X1 + X2 1, [X1. x2] 0. Express P as Ax = b, x 2 0, where A= and b = / 1]. Find all basic solutions for P: For j = we obtain B =[1 x 8 =[Ix =[ and [x1, x2) =[in For j = we obtain B =17 x 8 = x =[ and [x1, x2] = ]. For j = we obtain B =17.x 8 =1 x =[ and [x1, x2 1 = 107 The polyhedron P is a (No answer given) + The above set of basic solutions correspond to the set of (No answer given) * of P. In the standard-form representation of P, a feasible direction from the point [1, 0, 0] is