Cutting planes problem

Solve the following integer program using the Cutting Planes method with Chvzital-Gomor;r Cuts: max xvi1'2 s.t. 232+a'3-i-1'4 =5 5m1m2+x4=5 3:20 1362'. When solving the natural linear programming relaxation at the beginning of the cutting planes method start with basis B = {1, 2}. At each iteration be sure to clearly indicate the CGcut being taken and how you obtained it. Use the dual simplex method to avoid resolving from scratch at each iteration