The differential equation \( \frac{dy}{dx} + y = 5 \) is separable.
Solving: \[ \frac{dy}{dx} = 5 - y \] \[ \frac{1}{5 - y} dy = dx \] Integrating both sides gives \( -\log|5 - y| = x + C \).
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: