Problem 6: (Simplex Algorithm) [15 points] For the following maximization problem, the graph of the feasible region is given below: max3x1+2x2s.t.x1+2x22x1+x2x2x1,4050150 (a) (4 points) Write down the standard form of this LP problem. (b) (4 points) Write down the feasible basic solutions (including slacks). (c) (3 points) Assuming that the staring solution is (0,0), which will be the next basic feasible solution chosen by the simplex algorithm? Explain why. (d) (4 points) Write down matrix B corresponding to the vertex (20,10)