(a) Develop an algorithm that computes the kth smallest element of a set of n distinct elements in O(n + klog n) time. (Hint: Use a priority queue in the form of a binary heap.) (b) Specify the resulting running times for k Lvm and for k (e) Develop an algorithm that computes the smallest three elements and the largest three elements of a set of n 6 distinct elements in O(n) time