Write a file named $$hasqs$.$hs$$ that contains a Haskell function named $$hasqs$,$ which accepts a list of real values a$0$ through an$,$ and returns the sorted list with duplicate values retained. $($Note: Removal of duplicate values is trivial when using list comprehensions and thus not of interest here. But once you have completed this assignment you should think about how this can be easily accomplished as it shows how flexible comprehensions are.$)$ The required sorting algorithm is quicksort, which must be performed using list comprehensions, as in the Haskell list comprehension construct.