25. Consider the linear programming problem shown below: Maximize z = 3xi + 5x2 s.t xi + 2x2 0 xi and X2 are integers Xi The optimal non-integer solution of the above ILP model, with S, and S2 as the slack variables of constraints (1) and (2) respectively, is as follows: BASIC Xi Si S2 Solution Z 0 0 1/5 7/5 86/5 X2 0 1 2/5 -1/5 775 X 1 0 -3/5 4/5 17/5 Using the Cutting Plane Approach, find the optimal integer solution of the given ILP model. To find a cut, choose the row of x2. uuu 26. Maximize z = xy + 2x2 z = X s.t X1 + X2 0 xi and x2 are integers a) Solve by cutting plane