Consider a linear programming problem with two variables and two constraints. The objective function is to maximize x1+x2. The corner points of the feasible region are (0, 0), (0, 2), (2, 0) and (4/3, 4/3)
If an additional constraint X1+X2≤5 is added, the optimal solution is