Show how the quicksort algorithm begins to sort the following array of numbers:

 

44 75 12 43 70 23 85 55 33 Clearly label every function call and every change in the array as shown in the example. For example, quicksort(0,3): partition (0,3): swap 53/33: swap 53/12: swap 53/43: return 2 ==> quicksort (0,1) and quicksort (3,3) Please show the process for quicksort (0,8). 53 33 12 43 33 53 12 43 33 12 53 43 33 12 43 53 Activate Windows Go to Settingr