Give the in-place quick-select algorithm that selects k^thlargest element in the array A of n elements in a pseudo code. i.e. no use of L, E and G but every operation is performed in the array A.