Quiz: Meet in the Middle Advanced

In 'Closest Subsequence Sum', after generating sums for both halves, how do you find the closest to target?

1. A.Sort one half, for each sum in the other half binary search for closest complement
2. B.Compare all pairs from both halves
3. C.Hash map lookup for exact match
4. D.Sort both and use two pointers from opposite ends