given an unsorted array of n unique integers, you need to return the k smallest of them in sorted order. you come up with three algorithms to solve this problem: they are: • algorithm a: sort the array in increasing order and list the first k integers. • algorithm b: build a min-heap from these n integers, and then call extract-min k times. • algorithm c: use the linear time selection algorithm to find the kth smallest integer, then partition the array about that number, and finally sort these k smallest numbers