Consider the following array of numbers A = {15, 4, 21, 12, 10, 0, 21, 12, 3, 14}. a. Show the result of the various passes needed to sort A : i. Using Insertion sort ii. Using Bubble sort iii. Using...

Extracted text: Consider the following array of numbers A = {15, 4, 21, 12, 10, 0, 21, 12, 3, 14}. a. Show the result of the various passes needed to sort A : i. Using Insertion sort ii. Using Bubble sort iii. Using Selection sort iv. Using RadixSort (r = 5) b. Use a binary tree to show the different recursive calls resulting from using Merge Sort to sort A %3D