Use a Shell sort to rearrange the following numbers into ascending order, showing the new arrangement after each pass.
$$\begin{array} { l l l l l l l l }
28 & 22 & 20 & 17 & 14 & 11 & 6 & 5
\end{array}$$
Write down the number of comparisons on the first pass.
Write down the number of swaps on the first pass.
Find the total number of comparisons needed to rearrange the original list of 8 numbers into ascending order using a shuttle sort.
(You do not need to perform a shuttle sort.)