Consider the following all-integer linear program. Max5x1+8x2s.t.6x1+5x22511x1+4x2441x1+2x28x1,x20andinteger (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. 1 (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(x1,x2)=() (c) Find the optimal integer solution. at(x1,x2)=() Is it the same as the solution obtained in part (b) by rounding down? Yes No