Write down the recurrence relation of the following sorting algorithm. What is the time complexity of this method (in 0 () notation)? Justify your answer. Does this algorithm sort properly? Give an explanation if you think it does. Give a counterexample showing that it fails to sort if you think it doesn't. [10 pt] void StrangeSort(int a[], int min, int max) { if (min >= max) is wmint return; if (a[min] > a[max]) a max]). swap(a [min], a[max]); // constant-time operation int one_third = (max - min + 1) / 3; if (one_third >= 1) { Strangesort(a[], min, max - one_third); StrangeSort(a[], min + one_third, max); StrangeSort(a[], min, max - one_third)