Problem 7-02 (Algorithmic) Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 6x1 + 5x2 s 28 11x1 + 5x2 s 46 X1 + 2x2 5 8 x1, x2 2 0 and integer a. Choose the correct graph which shows the constraints for this problem and uses dots indicate all feasible integer solutions. (0) (1) 2 1 (iii) (iv) 2 b. Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. X1 x2 Optimal Solution to the LP Relaxation Round down to find a feasible integer solution. If your answer is zero enter "O" X1 X2 Feasible integer solution c. Find the optimal integer solution. If your answer is zero enter "O". X1= x2 Optimal Integer Solution Is it the same as the solution obtained in part (b) by rounding down? The input in the box below will not be graded, but may be reviewed and considered by your instructor