Question

suppose there are (ceiling[log n]) sorted lists of (floor[n/log n]) elements each.
Time complexity of producing a sorted list of all these element (use heap data structure)
a]O(n log log n)
b]theta(n log n)
c]Big Omega(n log n)
d]Big Omega(n^1.5)