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 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