PLEASE ANSWER BOTH

1. (10) You are doing a binary search on the following array for number 23. int nums[]={4,5,10,15,20,25,30,35,40,45,50,58,65,80,98} List the low, high, and midpoint values at each step until the algorithm stops. Do Not Write Any Code. You may either use the subscript (index) or the actual number stored at the subscript. High Mid Low 2.15) What output will be generated by the following Java package chapter9_1_15; public class Chapter9_1_15 public static void main(String[] args) { int[] a = new int[7]; int temp, n, newnum; 7; a [0] = 1; a [1] = 5; a [2] = 3; a [3] = 2; a [4] = 6; a [5] = a [6] = 98; n = 5; newnum = n/2; for (int i = 0; i