For the integer programming formulation below, answer the following questions Objective Z = 5x +4x2 subject to: IP formulation X, 54 2x, 512 3x, + 2x, 517 3x, + x, 23 X, 21 x; > 0, x2 > 0 X,,x, are intergers X1=0.667, X2=1, Z1*=7.333 X,=1 2 3 Infeasible X=1, X2=1, Z3*=9 (f) is the solution in node 1 with an objective value of 7.333 a lower bound solution or upper bound solution to this problem? (4 pts) (g) Explain why there is an infeasible solution in the node 2? [4 pts] (h) is the solution in node 3 with an objective value of 9 a lower bound solution or upper bound solution to this problem? (3 pts]