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

Merimize $z=-x_1+x_7$

subject $to$

$x_1-4x_{2}5$

$x_1-3x_{2}1$

$2x_1-5x_{2}1$

$x_1{x}_{2}0$

Note: Answer based on the rules tor entering and leawing variables of the dual simplex method. Which of the following is true for the given problem? Select atl that apply:

The optimum solution is obtained at $x_1=5,x_2=0.$

The optimal value of the objective function is $-5.$

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

The entering variable for the first iteration is $x_1.$