Create a client that produces partly sorted arrays with the following features: 95% of the data are sorted, while 5% are random values. All items that are within 10 places of their array position Sorted, with the exception of 5% of the items that were distributed at random across the array. Create and test ideas about how such input will affect how well the algorithms in this part function

Java

Create four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.

Write a program that creates a 3x3 2d array and populate it by user input. It then creates a secondarray of size 3 which stores the sum of each row in the user input matrix.If the matrix is [ [1,1,1], [2,2,2], [3,3,3] ], sums should be [3, 6, 9].The sums are then printed on the screen.