1) Sort the elements of the following array using merge-sort in increasing order. All steps of the solution are written in the details. A=(5,1,9,7,2,3,6,8)

Please use HEASORT to sort the input array [13 9 19 3 32 14 16 39 23 5 15] (not programming)

Please written by computer source

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++ )…