II$.$ State $($True or False$)$ for each of the following statements, and correct the wrong statements

In a linear programming $($LP$)$ model, the feasible solution space can be affected when redundant constraints are deleted. $()$

In the graphical method, when there is a constraint that is parallel to the objective function, the the feasible solution space is unbounded. $()$

In the simplex method, if there is a non$-$basic variable with coefficient equals zero in the objective function in the last iteration, then there is an alternative optimum solution. $()$