The merge sort is a recursive algorithm that can be used to sort an array by first sorting smaller versions of an initial list of object. Please provide a sample of code sample of Merge sort and describe the benefits of using the merge sort. What are the key steps that must be taken to ensure an efficient sorting of objects?

In the answer please give a real-life scenario where

• Merge sort may be used
• Merge sort may be a better fit than Quick and Radix sorts