0.5 points The optimal solution of this linear programming problem is at the intersection of constraints 2 and 3 \[ \begin{array}{l} \text { Max } 3 x_{1}+4 x_{2} \\ \text { st } \quad 4 x_{1}+1 x_{2}