Hello can you answer the follow mergesort question? I will make sure to thumbs up :)

2. Let us suppose that there are n elements in thc un-sorted array. Answer the following? 91: How is merge sort different from quick sort? 42: What is the split ratio in merge sort? 43: What is the worst-case/average-case/best-case running time of Merge Sort? q4: Why is the worst case running time of Merge sort O(n log n) always? 25: Why does Merge Sort use a static tree in the recursion process? It is worth noting that the Quick Sort use a dynamic tree. 2. Let us suppose that there are n elements in thc un-sorted array. Answer the following? 91: How is merge sort different from quick sort? 42: What is the split ratio in merge sort? 43: What is the worst-case/average-case/best-case running time of Merge Sort? q4: Why is the worst case running time of Merge sort O(n log n) always? 25: Why does Merge Sort use a static tree in the recursion process? It is worth noting that the Quick Sort use a dynamic tree