Problem 3. Consider the Klee-Minty problem covered in lecture. maximize 10- subject to 2.1 j=1 10+ 100-1 for i = 1, 2,...,n x20 for j 1,2,...,n (a) Write out the Klee-Minty problem for n = 3. (b) Using the matrix form of the simplex algorithm and the Python methods that we discuss in class, solve (a) using the largest coefficient rule. Make sure to print the dictionaries each step. Submit both your code and its output.