Problem
The sack contains n items of different weights. We want to divide the items evenly into two bags so that they carry the same amount of weight. If the problem can be solved in a polynomial time, briefly describe a polynomial-time algorithm. If not, use the fact that Subset Sum problem is in NP-Complete to prove that the prove the problem is NP-Complete.