1. Draw the simplex defined by the inequalities
2. Give the sequence of matrices produced for the example in the text if the pivot column chosen is the largest q for which a is negative.
3. Give the sequence of matrices produced for the example in the text for the objective function x1 + 5×2 + x3.
4. Describe what happens when the simplex algorithm is run on a matrix with a column of all zeros.