Consider the following IP: Min Z =2x1 -4x2 S.t 2x1 + x2 <= 5 -4x1 + 4x2 <= 5 x1, x2 >= 0; x1, x2 integer The optimal tableau for the IP's linear programming relaxation is given in the table below. Use cutting plane algorithm to find the optimal solution. z x1 x2 s1 s2 rhs 1 0 0 -2/3 -5/6 -15/2 0 1 0 1/3 -1/12 5/4 0 0 1 1/3 1/6 5/2