0/1 knapsack problem is a problem to find the maximum total value that can be put in a knapsack, given weights and values of n items, without exceeding the capacity of the knapsack. Given the...

0/1 knapsack problem is a problem to find  the maximum total value that can be put in a knapsack, given weights and values of n items, without exceeding the capacity of the knapsack. Given the following items:

A: 2 kg, $4

B: 4 kg, $9

C: 5 kg, $3

D: 1 kg, $3

E: 3 kg, $5

Identify and explain an algorithm strategy using binary tree structure and breath_first_search() method to find the combination of items that when added to a knapsack with maximum 8 kg capacity that will give the highest value