Show, in the style of quicksort trace given in Chapter 2.3 of the textbook, how quicksort

sorts the array E, A, S, Y, Q, E, S, T, I, O, N. For the purpose of this exercise, ignore the

initial shuffle. Please do it a table in excel

initial values random shuffle loj hi 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 QUICK SORT EXAMPLE K RATE LE PUI MOC XOS 0 5 15 E CAI E K L P UTM QR XOS 0 34 E CA E I K L PUT MORX OS 0 2 2 ACE E I K L P UTM QR XOS 0 0 1 ACEEI K L P UTM QRX OS 1 ACE E I K L P UTM QR XOS 4 ACE E I K L P UTM QR XOS 6 6 15 ACEEI K L P UTM QR XOS 7 915 ACEEI K L M 0 PTORXUS 7 7 8 A CE E I K L M O P T Q R XUS 8 ACEEI K L M 0 PT Q R XUS 10 13 15 ACEEI K L M O PSORTU X 12 12 ACEEI L M O P R S T U X 11 11 ACEEI K L M O P Q R S T U X 10 A C E E I K L M O P Q R S T U X 14 14 15 ACEEI K L M O P Q R S T U X 15 A C E E I K L M O P Q R S T U X no partition or subarrays of size 1 result A CE E I KL MOPQRSTU X initial values random shuffle loj hi 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 QUICK SORT EXAMPLE K RATE LE PUI MOC XOS 0 5 15 E CAI E K L P UTM QR XOS 0 34 E CA E I K L PUT MORX OS 0 2 2 ACE E I K L P UTM QR XOS 0 0 1 ACEEI K L P UTM QRX OS 1 ACE E I K L P UTM QR XOS 4 ACE E I K L P UTM QR XOS 6 6 15 ACEEI K L P UTM QR XOS 7 915 ACEEI K L M 0 PTORXUS 7 7 8 A CE E I K L M O P T Q R XUS 8 ACEEI K L M 0 PT Q R XUS 10 13 15 ACEEI K L M O PSORTU X 12 12 ACEEI L M O P R S T U X 11 11 ACEEI K L M O P Q R S T U X 10 A C E E I K L M O P Q R S T U X 14 14 15 ACEEI K L M O P Q R S T U X 15 A C E E I K L M O P Q R S T U X no partition or subarrays of size 1 result A CE E I KL MOPQRSTU X