chap data structures and algorithms imagine that you are programmer who must write function to sort an array of about integers from lowest value to highest value write down at least five approaches to sorting the array do not write algorithms in java or pseudocode just write sentence or two for each approach to describe how it would work think of an algorithm to find the maximum value in an (unsortedarray nowthink of an algorithm to find the second largest value in the array which is harder to implementwhich takes more time to run (as measured by the number of comparisons performed)nowthink of an algorithm to find the third largest value finallythink of an algorithm to find the middle value which is the most difficult of these problems to solve an unsorted list of integers allows for constant-time insert simply by adding new integer at the end of the list unfortunatelysearching for the integer with key value requires sequential search through the unsorted list until you find xwhich on average requires looking at half the list on the other handa sorted array-based list of integers can be searched in log time by using binary search unfortunatelyinserting new integer requires lot of time because many integers might be shifted in the array if we want to keep it sorted how might data be organized to support both insertion and search in log time