## Discussion Forum

Que. | Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure) |

a. | O (n log logn) |

b. | θ(n logn) |

c. | Ω(n logn) |

d. | Ω(n3/2) |

Answer:O (n log logn) |