Part 1 1. Write a permutation of 9 integers which is not in sorted order. Sort the integers using the sorting algorithms: Bubble Sort, Insertion Sort, Selection Sort and Quick Sort. Assume that the...

Q3 solution needed

in words ...not handwritten, please

Extracted text: Part 1 1. Write a permutation of 9 integers which is not in sorted order. Sort the integers using the sorting algorithms: Bubble Sort, Insertion Sort, Selection Sort and Quick Sort. Assume that the numbers are stored in an array. You should show the contents of the array after each iteration for all the algorithms. 2. Suppose you are to sort elements which are stored in a very large sorted array followed by a relatively small number of "random" elements. Which of the sequential sorting algorithms from Part 1.1 would be especially suitable for such a task? Justify your choice. 3. What issues are significant when assessing the relative merits of different sorting algorithms? Compare and contrast the sorting algorithms with respect to these criteria.