Consider the following LPP$,$ which is being solved by the dual simplex method.

Note: Answer based on the rules for entering and leaving variables of the dual simplex method.

Which of the following is true for the given problem? Select all that apply.

$1$ point

There is no feasible solution for the given LPP$.$

The optimum solution is obtained at

$$

$1$

$=$

$5$

$,$

$$

$2$

$=$

$0$

x

$1$

$$

$=5,$x

$2$

$$

$=0.$

The optimal value of the objective function is

$$

$5$

$5.$

The entering variable for the first iteration is

$$

$1$

x

$1$

$$

$.$