Solve the following knapsack problem by using the B&B algorithm $($when selecting the subproblem to be solved,

choose always the branch that corresponds to the fractional variable imposed to be zero$).$ Start by defining in the

first iteration both an UB and a LB$,$ then summarize your solution in the form of B&B tree that should include

all the details.