Example $8$ a$)$ Apply quicksort algorithm to place only the first pivot element $(14)$ to its correct position $($sorting will be in non $-$ increasing order from the largest to the smallest

$)14,21,8,13,5,19,24,18,28,11,7,45,9$ Show each step clearly to get credits. Do NOT only write the resulting position but show the intermediate steps clearly. b$)$ Count and write the total number of

comparison operations performed to place $14$ to its correct position.