Given a set of n distinct positive integers x1, x2, ..., xn (where n is an even number) (A) partition the set into two subsets each of cardinality n/2 such that the difference between the sums of the two subsets is maximized (B) partition the set into two subsets such that the difference between the sums of the two subsets is minimized Write an algorithm for (A) and estimate its resource requirements Write an algorithm for (B) and estimate its resource requirements