Implement a Binary Search algorithm, and using the results from Exercise 5, show how long the Binary Search takes (on average) for arrays of size 10, 100, and 1000. (You do not have to print out the values in the array).

You are given an array in which every number from 1 to N appears precisely once with the exception of one. How is the missing number to be located in O(N) time and 0(1) space? What if two numbers were absent?

Draw the state of the array after a first pass of a shellsort with gap size 5, and then again after a second pass with gap size 3. Need the first pass with gap size of 5 and second pass with gap size of 3.

Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.

you are given integers A = [a0, a1, a2, · · · an], where a are integers. We want to determine the largest sum of a portion of consecutive values in the array. array A = [3, 13, −20, 9, −3, 30, 9, −70], largest sum of a portion of consecutive values is 9-3+30+9 = 45. a) you must write an iterative algorithm that can determine the largest sum of a portion of consecutive values / show the time complexity b)Write a dynamic programming-based algorithm that determines the largest sum of a portion of consecutive values/show its time complexity