Consider the following BIP problem: Maximize Z = -5x + 25x subject to -3x + 30x 27 3x + x 4 and x, x are binary. (a) Solve this problem graphically. (b) Solve the LP relaxation graphically. Round this solution to the nearest integer solution and check whether it is feasible. Then enumerate all the rounded solutions by rounding this solution for the LP relaxation in all possible ways (i.e., by rounding each noninteger value both up and down). For each rounded solution, check for feasibility and, if feasible, calculate Z. Are any of these feasible rounded solutions optimal for the BIP problem?