Which of the following is true about the Mergesort algorithm applied to an array of numbers that are all different?

Kim Gigabit purchases items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting       /*  * To change this license header, choose License Headers in Project Properties.  * To change this template file, choose Tools | Templates  * and open the template in the editor.  */ package sortascending;     public class Sortascending {       public static void sortAsc( int[] arrayToSort )   {         // Find the integer that should go in each cell j of     // the arrayToSort, from cell 0 to the end     for ( int j=0; j<arrayToSort.length-1; j++ )…

Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)

C++

Mirrored Matrices Concepts Tested: iterating through multi-dimensional arrays, functions, function overloading Instructions:     1) Write a SET OF 3 OVERLOADED functions called flipMatrixHorizontal() that takes the following inputs:     a) a 2-dimensional array with any number of rows and 3, 4, or 5 columns (this is where the overloading comes in).     b) an array to put the flipped array values in     c) number of rows     d) number of columns   The function should reverse the ROWS (rotate around the horizontal axis)of the original array and put the new values in the flipped array.       2) Write a SET OF 3 OVERLOADED functions called flipMatrixVertical() that takes the following inputs:   a) a 2-dimensional array with any number of rows and 3, 4, or 5 columns (this is where the overloading comes in).   b) an array to put the flipped array values in   c) number of rows   d) number of columns   The function should reverse the COLUMNS (rotate around the vertical axis)of the original…

help please

Write an array that matches the following requirement, and provide explanation of how you got your answer.--> Using a insertion sort on the array compared to using a selection sort requires FEWER comparisons of elements.