The kth quantiles of an n-element set A are the k -1 order statistics that divide the sorted set into k equal-sized sets (to within 1). Thus, the kth quantiles elements of A are the elements of rank [n/kl, 2[n/k], 3[n/k], and so on. Give an O(n log k)-time algorithm to list the kth quantiles of a set