Consider the following all-integer linear program. Max 5x1 + 8x2 s.t. 6x1 + 5x2 3 25 9x1 + 4x2 S 36 1x1 + 2x2 5 8 *11*2 2 0 and integer (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. X2 X2 8 8 6 6 X1 X1 6 8 0 2 4 6 8 X2 X2 8 8 6 6 4 2 2 X1 X1 2 8 6 8 (b) Find the optimal solution to the LP Relaxation. (Round your answers to three decimal places.) at (x1, x2) = Using this solution, round down to find a feasible integer solution. at (X11 X2) = (c) Find the optimal integer solution. at (x1, x2) = Is it the same as the solution obtained in part (b) by rounding down? O Yes O No