I am very stuck on this problem. Thank you in advance.

k numbers in sorted order Given a set of n numbers in an arbitrary order, we wish to find k smallest among them and output them in sorted order. For each of the following approaches, write down pseudocode for an algorithm that implements the method mentioned and analyze your algorithm. You may call any algorithm that we covered up to this point as a subroutine. Your analysis should be in terms of n and k. For full credit, your algorithm should exhibit the best asymptotic worst-case running time for that approach. Sort the numbers in increasing order and output the first Build a min-priority queue from the numbers, and call EXTRACT-MIN k times Use an order-statistic algorithm to find the k-th smallest number, partition around that number, and sort the k smallest numbers before returning them How do the above approaches compare for various values of k