Write a file named p2.lisp that contains a Common LISP function named lins, which accepts a list of real values a₀ through a_n, and returns the sorted list in descending order using an insertion sort. Note that there may be from 0 (zero) to an arbitrarily large number of real numbers in the list, that any value in the list may appear any number of times up to the number of entries in the list. You must return a list containing the real numbers list as a sorted list.

The only parameter for the function is the list of real numbers to be sorted. Again, there may be an empty list passed, so you need to handle an empty list correctly (by returning an empty list).