6 What is the optimal solution of Problem P if one constraint at a time is removed (leaving the other two constraints in place) (i) constraint (1) is removed from the formulation? (ii) constraint (2) instead is removed from the formulation? (iii) constraint (3) instead is removed from the formulation? 7 For each one of the three points given by their coordinates (x), X) below, determine if the point is feasible, infeasible, and if a constraint is binding at that point (if infeasible, indicate the violated constraint(s) and if binding indicate which constraint is binding). Justify your answer by checking each constraint. (7,8) (-3,5) (1,9) 8 Construct the initial basic solution by adding artificial variables and making the necessary variable transformations so that you can apply the Big-M method to Problem P. Fill-in the (0) iteration tableau. Indicate the entering and leaving variable and perform a single Big-M iteration (1). Write the resulting basic solution (all variables with values) of iteration (1) and indicate whether it is feasible or infeasible to Problem P. Indicate on the graph the point this basic solution corresponds to and the constraints (if any) that are violated. 6 What is the optimal solution of Problem P if one constraint at a time is removed (leaving the other two constraints in place) (i) constraint (1) is removed from the formulation? (ii) constraint (2) instead is removed from the formulation? (iii) constraint (3) instead is removed from the formulation? 7 For each one of the three points given by their coordinates (x), X) below, determine if the point is feasible, infeasible, and if a constraint is binding at that point (if infeasible, indicate the violated constraint(s) and if binding indicate which constraint is binding). Justify your answer by checking each constraint. (7,8) (-3,5) (1,9) 8 Construct the initial basic solution by adding artificial variables and making the necessary variable transformations so that you can apply the Big-M method to Problem P. Fill-in the (0) iteration tableau. Indicate the entering and leaving variable and perform a single Big-M iteration (1). Write the resulting basic solution (all variables with values) of iteration (1) and indicate whether it is feasible or infeasible to Problem P. Indicate on the graph the point this basic solution corresponds to and the constraints (if any) that are violated