Consider the following all-integer linear program. Max 5% + %2 s.t. 6x, + 5%2 $ 35 10x, + 4%2 5 40 1x, + 2%2 $ 12 *1r *2 2 0 and integer (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. X2 X2 6 6 4 2 X] X] IX O 2 8 2 4 8 6 8 8 (b) Find the optimal solution to the LP Relaxation. (Round your answers to three decimal places. ) at (x], *2) =( Using this solution, round down to find a feasible integer solution. at (x ], *2) =( (c) Find the optimal integer solution. at (x 1, *2) = Is it the same as the solution obtained in part (b) by rounding down? Yes O No