12.16 LAB: Insertion sort 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 598 the output is: 3 2 1 5 98 2 3 1 5 98 1 2 3 5 98 1 2 3 5 98 1 2 3 5 98 1 2 3 5 89 comparisons: 7 swaps: 4

Write a program whose input is a character and a string, and whose output indicates the number of times the character appears in the string. The output should include the input character and use the plural form, n's, if the number of times the characters appears is not exactly 1. Ex: If the input is: n Monday the output is: 1 n Ex: If the input is: z Today is Monday the output is: 0 z's Ex: If the input is: n It's a sunny day the output is: 2 n's Case matters. Ex: If the input is: n Nobody the output is: 0 n's n is different than N.

Please give a full detailed optimized solution in Java 8 for the given problem, use the example code provided as well. Please provide comments and screenshots of code and output. Also, add the time/space complexity and the reason for it.Java 8 Code Example:import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution {     public static void main(String args[] ) throws Exception {         /* Enter your code here. Read input from STDIN. Print output to STDOUT */     } }

How to implement the below code snippet in Simple Javascript

Make a java airline reservation system.  Things the program should have: - Main menu(options to cancel, book and reschedule flights) - Use things like constructors, array lists, etc. - System.out.println your final ticket with the date of the flight, number and airline.

Convert the following java code to C++   //LabProgram.javaimport java.util.Scanner;public class LabProgram {public static void main(String[] args) {//defining a Scanner to read input from the userScanner input = new Scanner(System.in);//reading the value for Nint N = input.nextInt();//creating a 1xN matrixint[] m1 = new int[N];//creating an NxN matrixint[][] m2 = new int[N][N];//creating a 1xN matrix to store the resultint[] result = new int[N];//looping and reading N integers into m1for (int i = 0; i < N; i++) {m1[i] = input.nextInt();}//looping from 0 to N-1for (int i = 0; i < N; i++) {//looping from 0 to N-1for (int j = 0; j < N; j++) {//reading an integer and storing it into m2 at position i,jm2[i][j] = input.nextInt();}}//multiply m1 and m2, store result in result//looping from 0 to N-1for (int i = 0; i < N; i++) {//looping from 0 to N-1for (int j = 0; j < N; j++) {//multiplying value at index j in m1 with value at j,i in m2, adding to current value at index i// on…

In Java, Explain briefly the operation of each of the following iterator-related methods: (a) next (b) hasNext (c)iterator