The binary search algorithm searches for a value in an array by splitting the array in half and then recursing on one of the halves, based on the result of the comparison with the middle element. In class we saw that the worst case running time is (log n). Now consider the same algorithm but with a split into 10% and 90%. How would that a ect its asymptotic worst-case running time

Write a program that uses a two-dimensional array to store the highest and lowest temperatures for each month of the year. the program should output the average high, average low, and the highest and lowest temper- atures for the year. your program must consist of the following functions: a. function getdata: this function reads and stores data in the two- dimensional array. b. function averagehigh: this function calculates and returns the average high temperature for the year. c. function averagelow: this function calculates and returns the aver- age low temperature for the year. d. function indexhightemp: this function returns the index of the highest high temperature in the array. e. function indexlowtemp: this function retur