$($Chapter $10,$ Question $5)$ Assume the following list of keys:

$28,18,21,10,25,30,12,71,32,58,15$

a$.$ This list is to be sorted using insertion sort as described in this chapter for array$-$based

lists. Show the resulting list after six passes of the sorting phase$$that is$,$ after six

iterations of the for loop.

b$.$ Using selection sort, explain how you sort the keys.

c$.$ Compare insertion and selection sort algorithms.