Correct Answer (Detailed Explanation is Below)
A.
It is stable
Detailed Explanation
Merge Sort is generally considered a
stable sorting algorithm, meaning that equal elements retain their relative order when the merge operation is implemented appropriately. Stability can be important when sorting records using multiple fields. For example, if student records are first sorted by name and then by marks, a stable sort can preserve the previous ordering of equal-key records. Merge Sort also provides predictable O(n log n) time complexity.