Consider the following pseudocode for a sorting algorithm...

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