(a) Consider the following integer program. max (-2,-1,0,0,0)x subject to 1 % 1 0 0 g g g 0 1 0 as: 8 1 0 0 1 g : Z O, a: integer. Let 1% = (O, 0, %,...

The question is about cutting planes and valid inequalities. I just want to know how to provide all cutting planes for x bar and justify why, and how to prove that the inequality given in the question b is valid for IP. Thank you for your help.