Answer Happy

Please solve all these correctly as fast as possible.
Sorting 4.Write the algorithm of Merge Sort in brief and show the steps of sorting this array of integers using Merge Sort. [43, 65, 23, 19, 32, 39, 42, 26, 52, 28, 36, 58, 12, 15, 49] - 8 5.You are given an array of integers. The size (n) of the array is greater than or equal to 10. You are going to implement an efficient searching algorithm which needs to sort the array at first. But you are told that the element to be searched is always going to be among the first 10 elements of the sorted array. Among Selection, Bubble and Insertion sorting, which one are you going to use and why? - 3