![3. [10 marks] We want to find the k smallest numbers in sorted order from a set of n numbers. Determine the worst-case complexity of each of the following methods in terms of n and k. () Sort all n numbers using heapsort, and list down the k smallest ones. (ii) Build a min-priority queue and call GetMin k times.](../../../media.cheggcdn.com/media/442/442c7fd4-31f0-4037-af76-dc09c8808556/image.png)
3. [10 marks] We want to find the k smallest numbers in sorted order from a set of n numbers. Determine the worst-case complexity of each of the following methods in terms of n and k. () Sort
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured