. .. X Consider the following integer programming problem max z =7 x1 +9 X2 Sat - X1 + 3x2 5 6 (P 3) 7x1 + X2 S 35 X 1,X 2 EZ And the optimal tableau (with some missing values) for its LP relaxation is Z + ax1 + bx2 + cs1 + ds2 = e 1 IN X2 + : S1+ 22 252 = 22 2 1 3 9 X 1 S1+ 22" 22 $2 = 2 WhereS1 $2 Are two slack variables. (4.a) Please complete the missing values of the tableau labeled with a, b, c, d, e. Showsteps, (4.b) Please generate the appropriate cut (only one) for the cutting plane algorithm from the optimal Itableau. Please justify your choice of the selected constraint Very shortly.( Note: you must write steps to show how you obtain the cut Please Only find the cut, and do not perform iterations ). (4.c) Please obtain the first three subproblems that would be required for solving Problem (P3) utilizing the Branch and Bound method. Please justify your choice For branching a variable very shortly ( Note: you do not need to solve subproblems 2 and3 just write down the corresponding models, or if you prefer, explain using The tree structure (4.d) (bonus4pts ) Reformulate problem (P3) to an integer linear programming problem With only binary decision variables. (Hint: convert general integer to binary integer). Type here to search O X P W 6:50 PM cls 5/3/2021