I need help with the attached CS problem. Thank you.

Given an array with n numbers, selection sort is a sorting algorithm that works as follows: 1. Find the minimum number in the list. 2. Swap it with the number in the first position. 3. Repeat the steps above for the remainder of the list (starting at the second position). Effectively, we divide the list into two parts: the sublist of items already sorted, which we build up from left to right and is found at the beginning, and the sublist of items remaining to be sorted, occupying the remainder of the array. Here is an example of this sort algorithm sorting five elements: