Problem $9.$ Briefly, describe an algorithm to sort an array A using a subroutine for Select$($A$,$ k$).$ Divide the array A into n$5$ groups of $5$ successive elements of A$.$ All the groups are of size $5$ except

for possibly the last one.

Problem $10.$ Show that the medians for all the groups can be found in total time O$($n$)$