Use the branch-and-bound method to solve the following questions. You may use linprogto solve the corresponding relaxed LP problems. Use both intlinprog and ga to verify your final results. Maximize Z = 2x, + 4x2 + 3x3 + 2x4 Subject to 2x1- x2 + x3 3 3x2 + x3 - X4 54 2x1 + x2 - x3 + x4S2 x, 2 0 for i= 1,. 5 and x, is binary for j= 1,2,3 only.