2. (20%) Modify the code selection_sort.c such that it sorts starting with the last element in the sequence of values. The resulting array should be sorted from largest to smallest. (a) The sorting algorithm must be in a separate function called sort_reverse. (b) No external libraries may be used. (c) The function should print the sorted values of the input array. (d) The return value of the function should be an integer indicating how many values were swapped. (e) Your code should be properly formatted to reflect the scope of each statement. (f) Save the code as sort_reverse.c. /* Implementation of selection sort which sorts an integer array * in ascending order. = void selection_sort(int arr[], int size) { // sort array for (int i = 0; i