申論題

3. (16%) Suppose that n = 3, W = 6, and w₁= 2, w₂ = 4, W₃ = 5, we can construct a tree as follows:

(b) Consider another sum-of-subsets problem with n = 4, W =13, and w₁= 3, w₂ = 4, w₃ = 5, w₄ = 6. Use a similar tree as above, give a strategy to avoid searching every possible traversing route in the tree, and show that it can still get to the correct answer. (10%)