please help :) wil give thumbs up

linear programming problem

Step 1: Use the BigM method to try to solve the following LP problem. Stop in at most two iterations (1.e., at most two basis change), regardless whether or not you have solved the problem. min 2 = 11+12 s.t. 21 +39 54 21 - 225 21,19 20 Step 2: For each of the following statements, circle the correct bold word (DNY=Don't know yet), AND, of the statement is true, complete the information requested. (a) TRUE FALSE More iterations are needed to solve the problem. The current basic solution is Is the current solution feasible? YES NO (b) TRUE FALSE DNY This problem is infeasible. Justify if true. (c) TRUE FALSE DNY This problem is unbounded. Justify if true. (d) TRUE FALSE DNY This problem has a unique optimal solution. The optimal solution is: The optimal objective value is: (e) TRUE FALSE DNY This problem has multiple optimal solutions. One optimal solution is: Another optimal solution is: - (If needed, do 1 more iteration to find it.) The optimal objective value is