Solve the following instance by the Branch and Bound method using the Best First Search and Breadth First Search traversal strategies (the partitioning strategy will be in the order of the variables) while also showing the analysis of the search tree.

= 231 + 192 + 283 + 144 + 445

81 + 72 + 113 + 64 + 195 25

{0,1}