Exercise 1: Insertion Sort Consider the selection sort implementation from slide # 58 in lecture-12-apr-08.pptx. Change the code of this method to sort an array of things using same Thing you used in your homework assignments. Remember that things are sorted according to compareTo method. 1.2) Write code in the driver to do the following. 1.1) create an unsorted array of 10 things. print all elements in the array one element per line. call selection sort to sort your array. print all elements in the array after sorting one element per line. What to submit? 1. a screenshot of your selection sort method. 2. a screenshot of your main method. 3. a screenshot of the output window showing the array before and after sorting. DO NOT COPY AND PASTE THE CODE. INCLUDE SCREEN SHOTS. Department of Computer Science and Cybersecurity Exercise 2: Quick Sort Given the following array of numbers. 12 17 20 15 swap: Array after 2nd swap: Array after 3rd swap: Exercise 3: Merge Sort Given the following array integers 17 15 12 7 Suppose we partition this array using quick sort partitioning algorithm using 15 as the pivot. There is a total of three swap operations. Show the array after each swap operation. Array after 1st 20 ICS 240-50 7 18 11 18 25 11 25 Spring 2022 9 31 31 Draw the tree (similar to slide #77 lecture-12-apr-08.pptx) in that shows how the arrays arrays. divided then merged when using Merge Sort? Make sure to show clearly the contents of the sub-arrays in each step. You may draw on a piece of paper and include a screenshot of your paper.