In C# !

Modify the selection sort algorithm so it is generic AND will sort the array in reverse. Also 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

Provided selection sort algorithm:

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; } }