26. Given the feasible region for a linear-programming problem defined by the inequalities $x\ge 0,y\ge 0$, and $2x+y\le 15$, the feasible point where $x=y$ with the largest possible value for a $y$-coordinate has coordinates