The set-partition problem takes as input a set S of numbers. The question is whether the numbers can be partitioned into two sets A and A bar = S - A such that Sigma x n A = Sigma x in A bar x. Show that the set-partition problem is NP-complete.