B&B aigorithm on the given search tree should perform two upper bound updates. Enter those upper bound values as well as the

complete solutions yielding them below. When entering a complete solution make sure to put a blank space between subsequent jobs. For

example, $"1234"$ would be the correct way to enter if that complete solution yielded a new upper bound.

In implementing the B&B algorithm on the given search tree:

Which of the following unexplored partial solutions did you fathom $($i$.$e$.,$ eliminate$)$ when you updated your upper bound for the first time?

$1-.-$

$3_{-}-$

$42-.$

$2$

$41.-$

$43--$

$4-.-$