Max z = 10x1 + x2
s.t. x1 <= 1
20x1 + x2 <= 100
x1, x2 >= 0
a. Find all basic solutions and basic feasible solutions for this LP.
b. Solve the following LP using the simplex method.
c. Then graph the feasible region in terms of x1and x2. indicate the path of simplex iterations (i.e., use arrows to indicate the basic feasible solutions you found at each step of the simplex method and label the optimal solution). Which path did Simplex take at each iteration (from which point to which one)?