The Partitioning Problem: Given a set of n positive integers, partition the integers into two subsets such that the difference between the sums of the elements in the two subsets is minimum. (3 pts) Although the general version of the partitioning problem in intractable, special cases of the problem may have polynomial solutions. For example, assume that each of the input integers are either x or 2x, for some positive integer x. Can you suggest a polynomial and optimal algorithm for finding the best partitioning in this case