Problem 7-05 (Algorithmic) Consider the following mixed-integer linear program: Max 2X1 + 3x2 s.t. 4X1 + 7X2 S 28 6X1 + 3x2 S 18 X1, X2 2 0 and X1 integer a. Choose the correct graph which shows the constraints for this problem and uses boldface vertical lines to indicate all feasible mixed-integer solutions. (1) (ii) 32 8 6 6 5 S- 3 3 2 2 1 1 + 4 5 6 7 10 21 1 6 7 8 9 10 1 (iii) (iv) 3 2 1 6 7 8 9 10 1 6 10 21 Graph (0) b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. The optimal solution is given by X1 = X2 = . Its value is Round the value of x1 down to find a feasible mixed-integer solution. If required, round your answers to two decimal places. Rounding the value of x1 down to find a feasible mixed integer solution yields x1 = , X2 = with a value of Is this solution optimal? No Is this solution optimal? No Why or why not? The input in the box below will not be graded, but may be reviewed and considered by your instructor. c. Find the optimal solution for the mixed-integer linear program. If required, round your answers to two decimal places. Solution details X1 = Its value is