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: