4. Generate the dual simplex iterations for the following problems first by hand, then (using TORA for convenience), and trace the path of the algorithm on the graphical solution space. Minimize z=2x1 +3x2 s.t. 2x1 + 2x2 ≤ 30 x1 + 2x2 ≥ 10 X1, X2 ≥0