Design a divide-and-conquer algorithm that will find the missing string in Θ(n) time. Youcan assume that we can utilize thePartitionalgorithm that is used byQuickSort, bymodifying it to compare strings instead of comparing numbers (you do not need to show howto do the modification). Write the pseudo-code of your algorithm and explain how it works.(Hint: You can select the pivot used forPartitionalgorithm in an informed manner thatguarantees the resultant subarrays to be of nearly equal size.)

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