26. Given the feasible region for a linear-programming problem defined by the inequalities , and , the feasible point where with the largest possible value for a -coordinate has coordinates