3. Set-partition problem, given a set S= {ai, a2, ..., an} of positive integers (denoting asset values), requires partitioning into subsets Si and S2 that minimizes the difference in the total values of Si and S2. However all the assets are held in cash: each asset is either a $100, $10, or a $1 bill. a) Identify a greedy procedure to accomplish cash-Set-partitioning. In particular, clearly articulate the i-th step: which asset is allocated, to which set, and why? (7 pts) b) Does your procedure always produce the best partitioning? Either reason that or provide a counter-example. (3 pts)