Q. 39 Suppose there are ⌈ log n ⌉ sorted lists of ⌊ n/log n ⌋ elements each. The time complexity of producing a sorted list of all these elements is :
(Hint : Use a heap data structure)
(A) O(n log log n)
(B) θ(n log n)
(C) Ω(n log n)
(D) Ω(n3/2)
Answer: (A)
Explanation: 
