Make an algorithm that computes the k-th smallest element of an n-element sequence of distinct integers in O(n + klgn) time. The sequence should be intact after the retrieval is done. Whether using a min-heap or a max-heap is a decision you have to make in designing the algorithm. Give the algorithm in pseudocode. Justify that your algorithm runs in O(n + klgn).