A- Consider the select sort algorithm. The select sort is applied to M arrays, each of size N Assume that 25% of the arrays are already sorted in ascending order; 25% are sorted in descending order; and the rest are not sorted at all. What is the average time complexity for sorting the arrays when using select sort algorithm? B- You decide to use a combination of merge and quick sort. Instead of dividing the array all the way until you have N arrays of size one each, you decide to stop the divide process half way through at step (Lg(n)/2). At this point you use quick sort on the obtained arrays. Then you merge the sorted arrays Q1- What is the time complexity of the new Hybrid algorithm 02- Compare the time complexity of the new Hybrid algorithm with that of Merge sort Q3- Compare the time complexity of the new Hybrid algorithm with that of Quick sort Q4- Apply the algorithm to the following set of elements 16 4 2 14 15 3 12 11 1 105 97 813 6