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

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

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

3. For e.g. if n=4, m=31, (w_1,w_2,w_3,w_4) = …