import x FREE A b Success zy Section X D2L Course X Search Cchegg.cX Sign out X Mail - M X https://learn.zybooks.com/zybook/VALDOSTACS1302MihailSpring2024/chapter/17/section/12 =zyBooks My library > CS 1302: Principles of Programming || home > 17.12: LAB: Insertion sort 21°C Mostly sunny Apply Al ☆ Enrollme + " 3 Help/FAQ • Marlon Barrera Rondon The program has four steps: 1. Read the size of an integer array, followed by the elements of the array (no duplicates). 2. Output the array. 3. Perform an insertion sort on the array. 4. Output the number of comparisons and swaps performed. main() performs steps 1 and 2. Implement step 3 based on the insertion sort algorithm in the book. Modify insertionSort() to: ⚫ Count the number of comparisons performed. • Count the number of swaps performed. • Output the array during each iteration of the outside loop. Complete main() to perform step 4, according to the format shown in the example below. Hints: In order to count comparisons and swaps, modify the while loop in insertionSort(). Use static variables for comparisons and swaps. The program provides three helper methods: // Read and return an array of integers. // The first integer read is number of integers that follow. int[] readNums () // Print the numbers in the array, separated by spaces // (No space or newline before the first number or after the last.) void printNums (int[] nums) // Exchange nums [j] and nums[k]. void swap (int[] nums, int j, int k) Ex: When the input is: 6 3 2 1 5 98 the output is: 3 2 1 5 98 Search 5:27 PM 4/22/2024 import x FREE A b Success zy Section X D2L Course × Search C chegg.coX Sign out X Mail - M X Apply Enrollme + Al ☆ https://learn.zybooks.com/zybook/VALDOSTACS1302Mihail Spring2024/chapter/17/section/12 =zyBooks My library > CS 1302: Principles of Programming || home > 17.12: LAB: Insertion sort Ex: When the input is: 6 3 2 1 5 98 the output is: 3 2 1 59 8 2 3 1 5 9 8 1 2 3 5 9 8 123598 1 2 3 5 9 8 1 2 3 5 8 9 comparisons: 7 swaps: 4 555804.3482728.qx3zqy7 Breaking news Trump arrives at... LAB ACTIVITY 17.12.1: LAB: Insertion sort 1 import java.util.Scanner; هیچی Help/FAQ • Marlon Barrera Rondon 0/10 LabProgram.java Load default template... 3 public class LabProgram { 4 // Read and return an array of integers. 5 6 7 Scanner scnr = new Scanner(System.in); 8 int size scnr.nextInt(); 9 10 for (int i=0; i < size; ++i) { // The first integer read is number of integers that follow. private static int[] readNums() { int[] numbers = new int[size]; // Read array size // Create array // Read the numbers 11 numbers[i] = scnr.nextInt(); 12 } 13 return numbers; 14 } 15 16 17 // Print the numbers in the array, separated by spaces // (No space or newline before the first number or after the last.) Search 5:27 PM 4/22/2024