Consider the following all-integer linear program.

Max	5x1	+	8x2
s.t.
	6x1	+	5x2		35
	9x1	+	4x2		36
	1x1	+	2x2		12

x₁, x₂ 0 and integer

(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 (x₁,x₂) = ( , )

Using this solution, round down to find a feasible integer solution.

____ at (x₁,x₂) = ( , )

(c)Find the optimal integer solution.

___ at (x₁,x₂) = ( , )

Is it the same as the solution obtained in part (b) by rounding down? Yes or No