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