If the objective is to minimize cost, what is the optimal solution?

The intersection of Const $1$ and Const $2$

The intersection of Const $1$ and Const $3$

The intersection of Const $2$ and Const $3$

The intersection of Const $3$ and the $y-$axis

Question $5(0\mathrm{.}105$ points$)$

Listen

If solved for maximization, which of the following is true about the above problem?

The feasible region is unbounded. This problem does not have redundant constraints

The feasible region is bounded. This problem has redundant constraint$($s$)$

The feasible region is unbounded. This problem has redundant constraint$($s$)$

The feasible region is bounded. This problem does not have redundant constraints