6- write true or false in front of the following statements and disscuss your answer. 1- the right hand side in the constraints of linear programming problems should have negative value(s) in solution procedure using simplex method. 2- The feasible solution is unique. 3- The unbounded solution means the feasible region is open set. 4- If any variable have not non-negativity condition, can we solve the problem using simplex method. 5- max Z = - mini-Z)