$$ \begin{vmatrix} x-2 & 3x-3 & 5x-5 \\ x-4 & 3x-9 & 5x-25 \\ x-8 & 3x-27 & 5x-125 \end{vmatrix} = 0 $$
Given the Linear Programming Problem: Maximize \( z = 11x + 7y \) subject to the constraints: \( x \leq 3 \), \( y \leq 2 \), \( x, y \geq 0 \). Then the optimal solution of the problem is: