Quicksort works by: a$.$ Iterating through the array and finding the minimum$/$maximum element b$.$ Inserting elements into their correct positions directly c$.$ Dividing the array into smaller sub$-$arrays, sorting them, and then combining them d$.$ Comparing adjacent elements and swapping them if they are in the wrong order