Consider the integer program below: Max 3 . x1 +4 . 12 s.t 6x1 + 5x2 - 25 3 . x1 + 5 . 2 - 20 1, *2 20 and integer Determine a near optimal solution by a truncated branch-and-bound approach. Con- sider the subproblems using the MUB rule and the smallest number rule as tie- breaker. Stop the branch-and-bound procedure when you can be sure that the value of the objective function of your solution is at most 5% worse than the optimal objective function value