Problem 1: Use the branch-and-bound method to find the optimal solution to the following IP: max z = 7x + 3x S.t. 2x + x 9 3x + 2x 13 X, X20 and integers Problem 2: Use the branch-and-bound method to solve the following IP: max z = 4x + 3x + x3 S.t. 3x + 2x + x3 7 2x + x + 2x3 11 X1, X2, X3 0, X2, X3 integers

Problem 1: Use the branch-and-bound method to find the optimal solution to the following IP: maxz=7x1+3x2S.t.2x1+x293x1+2x213x1,x20andintegers Problem 2: Use the branch-and-bound method to solve the following IP: maxz=4x1+3x2+x3S.t.3x1+2x2+x372x1+x2+2x311x1,x2,x30,x2,x3integers