let gn is (n3). [16]4. Let w = 5,7,10,12,15,18,20 and m=35. Find all possible subsets of w that sum tom. Do this using Sum-of-subsets algorithm. Clearly state the bounding functionsused in the algorithm by state space tree

Skip to content
# let gn is (n 3 ). [16] 4. Let w = 5,7,10,12,15,18,20 and m=35. Find all possible subsets of w that sum to m. Do this using Sum-of-subsets algorithm.

let gn is (n3). [16]4. Let w = 5,7,10,12,15,18,20 and m=35. Find all possible subsets of w that sum tom. Do this using Sum-of-subsets algorithm. Clearly state the bounding functionsused in the algorithm by state space tree