Solve the following problems using the simplex method in the dictionary form. Note that problems 2, 3, and 4, require you to use the two-phase simplex method. For each iteration, in addition to other calculations, clearly show the following: the dictionary, entering variable, minimum ratio, and the leaving variable. Note that we employ Dantzig's rule with the smallest index breaking ties. 1. max x1 + 2x2 + 3x3 subject to: x1 + 2x3 <= 3 x2 + 2x3 <= 2 x1; x2; x3>= 0