Question) Selection sort algorithm is given below. 1. for each value of fill from 0 to n-2 2. Find index_of_min, the index of the smallest element in the unsorted subarray list[fill] through list[n-1] 3. if fill is not the position of the smallest element (index_of_min) 4. Exchange the smallest element with the one at position fill. FIGURE 7.15 (0) (1) [2] [3] 74 45 83 16 Trace of Selection Sort fill is o. Find the smallest element in subarray list [1] through list (3) and swap it with list[0]. [0) [1] [2] [3] 1645 | 83 74 fill is 1. Find the smallest element in subarray list (1) through list (3]-no exchange needed. [0] (1) [2] [3] 16 45 83 74 fill is 2. Find the smallest element in subarray list [2] through list [3] and swap it with list [2]. [0] [1] [2] [3] 16 45 74 83 /* Figure 7.16 Function select_sort */ /* * Finds the position of the smallest element in the subarray * list[first] through list[last). * Pre: first = 0 */ void select_sort(int list[], /* input/output - array being sorted */ int n) /* input - number of elements to sort */ { int fill, /* index of first element in unsorted subarray */ temp, /* temporary storage */ index_of_min; /* subscript of next smallest ment */ for (fill = 0; fill