Question

Consider a problem with seven items whose weight and values are given below. w1, w2,.., W7 (40, 50, 30, 10, 10, 40, 30) p1, p2,.,, p7 (40, 60, 10, 10, 3, 20, 60) The total allowable weight in the knapsack w = 100, solve this problem using backtracking and draw a complete DFS tree.

Answer 1

Gtiven weights W, So, 30, 10, 10, 40, 3o f' : {kpo, 60, to, 10, 3, 20, 60 3 A B C DEF total weight lo0 check fon all pmible raiin Gackthackin oVv val: 0 val-o thal then vals becomex Ho and weigk»emaini usu be routed to 60 (as weight, 4 au poibe

val: 40 100 out aryt page) val -lo0 Wt-10 val too no Poni bb._ in 103 va -100 hot Powible valloo (1 vatloo

val 4o ot 60 ,o in : 30 Val ut Ut: 20 6 tho 4-40 E) val-50 wt 30 (End Val :73 2 t 2D val so in esible. valso wt-3D

t 100 in :LOO out 30 F 133 E 133 i the moinum Val w at con b btained.

NOTE: If you are satisfied with my answer please do upvote and if you have any kind of doubts please post in comment section. i'll surely help you there.
Thank You:)