We are given an array of integers (the array is a multiset meaning a number can appear more than once in the array)
- We have to partition the multiset into two subsets such that sum of the elements in the first partition is the same as the sum of elements in the second partition