How do you solve this?

You can use these tables.

3. Sort this list of letter alphabetically using the following twil algorithms. For each, show the state of the list after each step of the algorithm, ie when the sorted portion of the list has grown by one item. NDLYGPWC A. Sort the list using selection sort. B. Sort the list using insertion sort. \begin{tabular}{|c|c|c|c|c|c|c|c|} \hlineN & D & L & Y & G & P & W & C \\ \hline & & & & & & & \\ \hline & & & & & & & \\ \hline & & & & & & & \\ \hline & & & & & & & \\ \hline & & & & & Y & & \\ \hline C & D & G & L & N & P & W & Y \\ \hline \end{tabular}