The partition problem is defined as follows: Instance: a (multi-) set of integers S={a₁,a₂,.....aₙ}. The approximate-partition problem is defined as follows:
A) Finding a subset of S such that the sum of elements in each subset equals the total sum of S.
B) Dividing S into two subsets such that the difference between the sums of elements in these subsets is minimized.
C) Creating multiple subsets of S such that the difference between the sums of elements in each subset is minimized.
D) Finding the largest subset in S where the sum of elements equals a specific target sum.