Consider the following linear programming problem:

Maximize $2$X $+10$Y

Subject to:

X $+2$Y $<=80$

$8$X $+2$Y $<=96$

$3$X $+4$Y $<=360$

X$,$ Y $>=0$

This is a linear programming problem in which

options :there is no feasible solution

the solution cannot be found graphically

there is an unbounded solution

there is a redundant constraint

there are multiple optimal solutions