Problem 4. Consider the following pseudocode for a sorting algorithm, for 0 1. badSort (AO...n-1]) if (n=2) and (A[0] > A[1]) swap A[0] and Af1] else if (n > 2) m = fa.nl badSort(A[O...m-1]) badSort(A[n-m...n-1]) badSort(A[O...m-1]) Problem 4.a. (3 points) Show that the divide and conquer approach of badSort fails to sort the input array if a