Consider the following partial branch$-$and$-$bound tree. Nodes are labeled $0-10$ indicated in parenthesis. The labels do not necessarily reflect the order in which the nodes were processed.

$($a$)$ Is this tree for a minimization or a maximization problem?

$($b$)$ Which nodes do you still need to branch from? Why?

$($c$)$ Which nodes do you not need to branch from? Why?

$($d$)$ What is the gap between the best solution and the best bound found so far?

$($e$)$ In what order were the three integer solutions found in the branchand$-$bound process?