we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to
a) O ( log m log(log n) )
b) O ( log n log(log m) )
c) O ( log m log n)
d) O ( m log log n)