Consider The Following Allinteger Linear Program Max 1×1 1×2

Consider the following all-integer linear program:
Max 1×1 + 1×2
s.t.
4×1 + 6×2 ≤ 22
1×1 + 5×2 ≤ 15
2×1 + 1×2 ≤ 9
x1, x2 ≥ 0 and integer
a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions.
b. Solve the LP Relaxation of this problem.
c. Find the optimal integer solution.