(i) show the steps of sorting the input 15,13,525,32,84,53,22,125 using shell sort and shell's original sequence h_t=N/2, h_k=h_k+1/2

(ii) Suppose that instead of sorting, we wish only to find the m^th smallest key in a given random list of size n. show how quick-sort can be adapted to this problem, doing much less work than a complete sort. Write the modified quick-sort function. Show your function works properly for a suitably chosen example with n=10 and m=3.