Consider the linear optimization problem in standard form minimize X3 2x4 - 3x6 + 2x7 - 2xg + 3x9 + 2x11 + x12 subject to x1 + x3 + x4 + X6 X7 X9 X10 X12 = 0 X2 X3 X5 X6 Xg + xy + x1 + x12 = 0 X1, X2, X3, X4,X5, X6, X7, X3, X5, X10,X11,X12 > 0 Starting from the basis {x1,x2}, show that the simplex algorithm applied to the problem above can cycle in 12 iterations. Hint: Let xz enter the basis on the first iteration. Then let X4 enter the basis on the second iteration