IT'S AN JAVA PROGRAM

Question 5: (30 marks) Given the following numbers found in an array: 8, 4, 7, 1, 9, 2. In the selection sort, you should indicate the number of expected comparisons in each round in terms of the number of elements n(for example, n-1 comparisons). Also, you should indicate the total number of comparisons and deduce the time complexity. In the insertion sort, just mention the time complexity. a) Use selection sort to sort the original list of numbers. (15 marks) b) Use insertion sort to sort the original list of numbers. (15 marks)