Consider the following all-integer linear program:
Max
5x₁ +8x₂ s.t.
6x₁ + 5x₂ <30,
9x₁+4x₂<36
1x₁+2x₂<10,
x₁,x₂ > 0 and integer.

a. Graph the constraints for this problem, use dots to indicate all feasible integer solutions.
b. Find the optimal solution to the LP relaxation, round down to find a feasible integer solutio