the binary search algorithm is used to find the value 24 in the array below. | 10 | 15 | 17 | 24 | 35 | 36 | 41 | 45 | 48 | 57 | 65 | 68 | 70 | 74 | 80 | 83 | 90 | What will be the value of the variable last when the binary search algorithm completes? a. 16  b. 8  c. 5 d. 7 e. 6

Assume that we have a sorted list in an array: Index:         0       1       2         3       4        5      6      7      8       9        10        11 numbers:   12     15     17      19     22      26    28   30    32     34       36       38 we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19  the indexes and not the actual numbers in the list otherwise

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

JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Perform algorithm time measurement for all three quadratic sorting algorithms for Best Case (already sorted), Average Case (randomly generated), and Worst Case (inverse sorted) inputs and compare them with O(N*logN) sorting algorithm using Arrays.sort() method. Use arrays sizes of 50K, 100K, and 200K to produce timing results. Ignore the message "There is an infinite loop!" that appears on HyperGrade after submitting your program. Unfortunately, HyperGrade is designed to limit the amount of time that your program is allowed to execute.