GAINZ20 GAIN 3. You apply merge sort (divide-and conquer) on a list of beginning last index 105. Show calculation details: index 35 and ow 35 high- mida beginning index of the second sublist- How many elements in each of the subl ist? 4. What is the worst-timen how work.) 5. What is the worst time number of comparisons for merging two pre- sorted sublists of 40 elements each? 6.(Optional) What is the worst-time number of comparisons for merge sort for 22 elements