Answer based on Algorithm analysis.

a. Given a set S of n integers and another integer x. Describe (n log n)- time algorithm to determine whether or not there exist two elements in S whose sum is exactly x.

b. Merge k sorted list length n/k lists using binary min-heap. Analyse the time complexity of your algorithm.