CammIMS16 7.E.005 Consider the following mixed-integer linear program. Max 3X1 + 4X2 s.t. 3x1 + 7X2 s 21 6x1 + 5X2 5 30 X1/ X2 2 and x, integer (a) Graph the constraints for this problem. Indicate on your graph all feasible mixed-integer solutions. *2 X2 + X1 IX - O 2 6 (b) Find the optimal solution to the LP Relaxation. Round the value of x, down to find a feasible mixed-integer solution. (Round the values of x2 and the optimal solution to three decimal places, if necessary.) at (x1, x2 ) = Is this solution optimal? Yes No (c) Find the optimal solution for the mixed-integer linear program. (Round your answers to three decimal places, when necessary.) at (X1, * 2 ) =( TV