Merge Sort is a sorting algorithm that operates using the Divide and Conquer approach. It divides the list into two halves and then merges them in sorted order