[5.11] How would you use the revised simplex method to solve a bounded variables linear programming problem? Consider the following bounded variables linear program: a. Draw the feasible region in the (x1,x2) space and identify the optimal solution. Is this degenerate? Why or why not? b. For the extreme point (x1,x2)=(1,1), identify the working basis B and set up the revised simplex tableau by determining B1,cBB1, the objective function value, and the basic variable values. Continue solving the problem from this basic feasible solution using the bounded variables revised simplex algorithm. c. Denote the right-hand-sides of the first two constraints by b1 and b2. What conditions must b1 and b2 satisfy for the optimal partition to remain optimal