~~ Question Completion Status:

QUESTION $7$

$16$ points

B&B algorithm 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.

$\backslash$table$[[$UB #$,$UB Value,Complete Solution$],[0,($infinity$),$n$/$a$],[1,,],[2,,]]$

QUESTION $8$

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