Write this code in RUST and COMMON LISP:

DO NOT COPY FROM AI GENERATED MACHINE OR CHATGPT

WRITE MERGE SORT: Merge$-$sort is one of the most efficient sorting techniques and it$$s based on the $$divide and conquer$$

paradigm. Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty

or has one item, it is sorted by definition $($the base case$).$ If the list has more than one item, the list

is split, and a merge sort is invoked recursively on both halves. Once the two halves are sorted, the

fundamental operation, called a merge, is performed. Merging is the process of taking two smaller

sorted lists and combining them together into a single, sorted, new list. Write a program to

implement merge sort algorithm for the given array using recursion:

Input array: $1430,3292,7684,1338,193,595,4243,9002,4393,130$

The program must output the following:

$$ The input $($unsorted sequence$)$

$$ The sub$-$arrays

$$ The output $($sorted sequence$)$

$$ The number of comparisons.