State a recurrence for the number of comparisons done by BadSort...

Please just solve HIGHLIGHTED questions (4c, 4d).

Please explain every step of your logic.

This is a modification of stoogesort: https://www.geeksforgeeks.org/stooge-sort/

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