Given the following array: {24, 3, 27, 13, 34, 2, 50, 12}

If the array were sorted using selection sort, what would the array look like after the third pass of the algorithm (i.e., after the third time that the algorithm performs a pass or partial pass through the elements of the array)?

If the array were sorted using insertion sort, on how many iterations of the outer loop would the inner do...while loop be skipped?

If the array were sorted using Shell sort, what would the array look like after the initial phase of the algorithm, if you assume that it uses an increment of 3? (The method presented in lecture/the code in Sort.java would start with an increment of 7, but you should assume that it uses an increment of 3 instead.)

If the array were sorted using the version of bubble sort presented in lecture, what would the array look like after the fourth pass of the algorithm?

If the array were sorted using the version of quicksort presented in lecture, what would the array look like after the initial partitioning phase?

If the array were sorted using radix sort, what would the array look like after the initial pass of the algorithm? (We will cover this algorithm in lecture on Thursday, July 21.)

If the array were sorted using the version of mergesort presented in lecture, what would the array look like after the completion of the fourth call to the merge() methodthe method that merges two subarrays? Note: the merge method is the helper method; is not the recursive mSort method.