A minimization linear programming problem has been converted to its dual maximization problem. Simplex method is then applied to the maximization problem. The final maximization simplex table is given, which of the following is the point at which the minimization problem is optimized? * 1 bola V 0 0 1 0 X 5 -3 1 22 4 1 3 15 Z 1 5 4 17 Constant 8 3 2 300(Objective Row) O(x, y, z) = (2,3,8) O (x, y, z) = (8,3,2) O (u, v) = (8,2) O(x, y, z) = (22,15,17)