Problem 3: Consider the following simplex tableau corresponding to a maximization problem (rhs = right hand side): Z 20 2 C 3 C 4 205 X 6 207 rhs basic var. H ao O 0 0 40 0 25 700 a1 O 0 1 1/2 0 -2 84 2 4 a2 0 0 -2 0 5/2 225 20 2 O a3 0 3/2 1/2 125 X 3 O a4 5/2 1 -3/2 65 X 6 For each question below, give values of do, a1, a2, a3, 04 E R so that the tableau will satisfy the stated condition. If there are multiple values possible, then only one is sufficient. 1. The corner point corresponding to the tableau is the unique solution. 2. The corresponding corner point is a solution but it is not unique, and an alternative corner point solution satisfies x1 = 13. 3. The corresponding corner point is not a solution, and the next corner point computed by the simplex algorithm satisfies that x4 = 0 with the objective equal to 742. 4. The corresponding corner point is not a solution, and the next corner point computed by the simplex algorithm satisfies that x3 = 0 and x6 = 40