Problem 4 (6.5.2, 8 points): Apply branch-and-bound to solve the Problem 2 (6.1.2). Obtain lower bounds using Lagrangian relaxation and constraint relaxation, and verify that they are identical. 2 Problem 2 (6.1.2, 4 points): Consider the problem min f(x) = 10.01 +372 s. t. 5.01 +32 > 4, 21,2 = 0 or 1. a) Sketch the set of constraint-cost pairs {(4 5x1 - 12, 10.01 +3.12): 11, 12 = 0 or 1}. b) Sketch the dual function. c) Solve the problem and its dual, and relate the solutions to your sketch in part (a)