TORA Experiment. Solve Example 3.5-3 using TORA's Iterations option and show that even though the solution starts with X1 as the entering variable (per the optimality condition), the simplex algorithm will point eventually to an unbounded solution.