Minimize: $Z=3 x+2 y$. The minimum value of the objective function is obtained at the corner point ( 2 , 0).
The optimal solution of the above linear programming problem $\qquad$

- Adoes not exist as the feasible region is unbounded.
- Bdoes not exist as the inequality $3 x+2 y<6$ does not have any point in common with the feasible region.
- Cexists as the inequality $3 x+2 y>6$ has infinitely many points in common with the feasible region.
- ✓exists as the inequality $3 x+2 y<6$ does not have any point in common with the feasible region.