We are to apply Heap Sort on array: 40 63 8 19 5 60 52. What is the content of the array after Step 1 of Heap sort : build the initial heap?   Question 25 options:   40, 60, 63, 19, 5, 8, 52   63, 40, 8, 19, 5, 60, 52   63, 40, 60, 19, 5, 8, 52   40, 63, 8, 19, 5, 60, 5

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

Q2 You have a dynamic array with 3 elements in it and a capacity of 4. The capacity doubles when additional space is needed and shrinks by 50% (rounding down) when the size is at or below 1/3 capacity. Answer the questions below for the following operation sequence: Add, Add, Remove, Remove, Remove Q2.1 What will be the capacity of the list when the whole sequence is completed? Answer= Enter your answer here

Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…