Write the following merge sort in prolog language, do not copy from chatgpt or any AI generated wesbite.

Merge sort is a recursive algorithm that divides a list in half until it reaches a base case of an empty list or a single item, which is inherently sorted. It then merges the sorted halves back together. The merging process combines two smaller sorted lists into a single sorted list. To implement the merge sort algorithm:

Start with an unsorted sequence.

Recursively divide the sequence into smaller halves until each subsequence is either empty or contains only one element.

Merge the sorted sub$-$sequences back together by comparing elements from each sub$-$sequence and placing them in sorted order.

VERY IMPORTANT:

Output the original unsorted sequence, the sorted sub$-$arrays, the final sorted sequence, and the number of comparisons made during the sorting process.