Solve the following problem using the simplex algorithm and show all of your work (all dictionaries and a list of which variables are basic with their values and which variables are 1 non-basic at each iteration). For each problem, identify if there is a unique optimal solution, if there are multiple optimal solutions (if so find 2), if the problem is degenerate, or if the problem is unbounded. max z=x1+x2+ x3
x1+ x2 <=1
- x2+ x3 <=0
x1,x2,x3