Let us suppose that there are n elements in the un-sorted array. Answer the following?

q1: How is merge sort different from quick sort?

q2: What is the split ratio in merge sort?

q3: 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?

q5: Why does Merge Sort use a static tree in the recursion process? (It is worth noting that the Quick Sort use a dynamic tree.)

Can Somebody help answer these questions and ill give a thumbs up