Modify the selection sort algorithm seen in this code (In C# coding language) so it is generic AND will sort the array in reverse.

Add a local variable count (make sure to use the type long) that will count the number of elements comparisons that were performed for this sorting.

Display the value of count before exiting this method.

The method should have the following header: static void GenericReverseSelectionSort(T[] arr) where T : IComparable

please also be sure to also add meaningful comments in the code and to follow ALL steps listed above.

I will be sure to upvote.

CODE to modify:

static void SelectionSort(int[] arr) //O(n^2) { for (int i = 0; i < arr.Length-1; i++)//O(n^2) { int posMin = i; for(int j=i+1; j< arr.Length; j++) //O(n) { if (arr[j]

//swap elements at position i and posMin int tmp = arr[i]; arr[i] = arr[posMin]; arr[posMin] = tmp; } }