hello i need the solution please

Problem 4: Solve the following IP using Branch-and-Bound: Min 5x + 6x2 + 7x3 + 8x4 + 9x5 Subject to: 3xx2 + x3 + x4-2x522 x + 3x2-x3-2x4+x5 20 -XX + 3x3 + x4 + X5 21 X1, X2, X3, X4, X5 = 0 or 1 Problem 5: Solve the following IP using Branch-and-Bound: Max 3p + 4q + 2r + s + 2t Subject to: 2pq+r+s+t3 -p+3q+r-s-2t 2 2p+q-r+s+ 3t 1 p.q, r, s, t in Z+ Problem 6: Consider the following IP problem: Max z = 8 x1 + 5x2 Subject to x1 + x6 9x1 +5.x2 45 X1, X220; and integers The following figure shows the branch and bound tree for the IP problem, where is the order of solving the subproblems: Subproblem 1 * = 4 X 24 Subproblem 2 Z = 41 2 2 Subproblem 4 Intemible 4 =4 4 = X 1 =4 1,25 Subproblem 6 z = 40 Subproblem 51 2 = 4 = 4 4 =1 1=5 453 Subproblem 3 A 1 =3 LB = 40 454 Subproblem 7 2 = 37 1=5 4 = 4 3=0 4 =1 Candidate solution Candidate solution Answer the following: a) For each subproblem identify the reason for branching the subproblem. b) Write the complete LP model for subproblem 5. c) What is the optimal solution for the IP problem? x