Giving the following elements: 135, 22, 332, 65, 60, 10 (For ALL tasks below, we are putting the elements into ASCENDING order): a. Show the status of the list after the first swap when using selection sort
b. Show the status of the list after the first swap when using insertion sort
c. Show the status of the list after the first swap when using bubble sort
d. Show step by step how the elements are sorted using Radix Sort (must show all the buckets, and the result of each round in order to receive full credit).
e. Show the partitions if 10 is used as the pivot (show the two partitions for 135, 22, 332, 65, 60. Make sure not to do any extra swap than the algorithm requires)
f. Show the partitions if 65 is used as the pivot (show the two partitions for 135, 22, 332, 60, 10 Make sure not to do any extra swap than the algorithm requires)
g. Discuss why we say the choice of the pivot is playing a vital role in QuickSort based on your observation as look into the partitions you generated after the previous two sub-tasks are done.