please only answer if you know how to solve! Also, please do not take incorrect answer from similar questions! thank you :)

Consider the following all-integer linear program. Maxs.t.x1,x25x1+8x26x1+5x2259x1+4x2361x1+2x280andinteger (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. (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