1). An Integer Programming problem in which all variables must be integer is being solved The optimal tableau for the LP relaxation is given below. A cut to be added next is: z x1 x2 x3 x4 x5 x6 RHS 1 0 1.5 3 0 0 0 6.25 0 1 30 0 0 0 2 10 0 0 1.3 -0.6 0 1 2.9 1.4 0 0 1.4 -5.2 1 0 -1.3 5 (a). What are the two branches that should be added next, if solving the above problem using the branch and bound method. method. (b). What is a cut that should be added next, if solving the above problem using the cutting plane method.