4 The diagram shows the feasible region of a linear programming problem.
\includegraphics[max width=\textwidth, alt={}, center]{194d16e0-8e05-45c0-8948-99808440ed2a-005_1349_1395_408_294}

1. On the feasible region, find:
   1. the maximum value of \(2 x + 3 y\);
   2. the maximum value of \(3 x + 2 y\);
   3. the minimum value of \(- 2 x + y\).
2. Find the 5 inequalities that define the feasible region.