Question: 2 . You are given indivisible items A , B , C and D with weights 8 , 3 , 2 and 9 kgs and

2. You are given indivisible items A,B,C and D with weights 8,3,2 and 9 kgs and values 120,90,45 and 150 pesos respectively. Using brute-force, find the subset that can fit a knapsack of capacity 15 kgs with the largest total value. What is this total value? Show your solutions.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!