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). that is, the kth quantiles are select(a, n/k), select(a, 2n/k), …, select(a, (k − 1)n/k) (here we are assuming that k divides n). finding the kth quantiles directly in this way would take o(nk) time. given an unsorted array a of n distinct keys and an integer k, with 1 ≤ k ≤ n, give an o(n log k) algorithm to find the kth quantiles of a. you may assume that k divides n. you may assume that the linear-time (deterministic) select algorithm (page 220) is available as a subroutine.1. describe your algorithm in pseudocode. comment your code.2. prove that your algorithm is correct, i. e., argue that it returns the kth quantiles of a. use induction.3. analyze the running time of your algorithm, i. e., explain carefully why your code runs in o(n log k) time.