Explain sum of subset problem, Find all possible subsets of weight that sum to m, let n =6, m = 30, and w[1:6] = {5, 10, 12, 13, 15, 18).

Lesson 4

# Backtracking and Branch- and-bound

#### Sum of subsets

Write an algorithm of sum of subsets. Solve following problem and draw portion of state space tree M = 35, W = (5, 7, 10, 12, 15, 18, 20)

**Answer:**... (more)

Write and explain sum of subset algorithm for n = 5, W = {2, 7, 8, 9, 15} M = 17

**Answer:**... (more)

Write and explain sum of subset algorithm for n = 5, W = {2, 7, 8, 9, 15} M = 17

Given positive numbers (weight) w_i where (1<=i<=n) and m.

This problem calls for finding all subsets of w_i whose sum ...