The Knapsack Problem is a well-known search problem described as follows: There is a knapsack (container) of given space

[answerhappygod]

The Knapsack Problem Is A Well Known Search Problem Described As Follows There Is A Knapsack Container Of Given Space 1 (11.79 KiB) Viewed 45 times

The Knapsack Problem is a well-known search problem described as follows: There is a knapsack (container) of given space capacity B and a set of N items. Each item i has a given size Si and generates profit Pi it it is included in the knapsack: There is no space in the knapsack to pack all the N items. The problem is to select which items to pack in the knapsack so that the total profit is maximized without exceeding the capacity of the knapsack. Sketch a nearch tree for this soarch problem. Indicate the depth and uze of the search tree. Suggested answering time 10 minutes.