Îõ³h&­²)      !"#$%&'( Safe-InferredÌÚl" sorted-list×Type of sorted lists. Any (non-bottom) value of this type is a sorted list. Use the )# instance to merge sorted lists. sorted-listO(1)å. Decompose a sorted list into its minimal element and the rest. If the list is empty, it returns *. sorted-list Create a  by sorting a regular list. sorted-listO(1). Create a list from a 2. The returned list is guaranteed to be sorted.+ sorted-listÉMerge two sorted lists. This assumes that both input lists are sorted. sorted-listO(1)-. Create a sorted list with only one element. sorted-listÆAn infinite list with all its elements equal to the given argument. sorted-list3Replicate a given number of times a single element. sorted-listDual (sort of) to ,½ for sorted lists. It builds a sorted list from a generator function and an initial element. The generator function is applied to the initial element, and then it will produce either *4 - meaning that the list building must stop - or -¡ applied to the value that is going to be added to the list, and a new accumulator to be fed to the generator function. The list building will stop prematurely if the generator function happens to create an element for the list that is strictly smaller than the previous value. sorted-list¦Create a sorted list by repeatedly applying the same function to an element, until the image by that function is stricly less than its argument. In other words: %iterate f x = [x, f x, f (f x), ... ]!With the list ending whenever 1f (f (... (f (f x)) ...)) < f (... (f (f x)) ...)6. If this never happens, the list will be infinite.By definition: )iterate f = unfoldr (\x -> Just (x, f x))  sorted-listO(n)(. Insert a new element in a sorted list.  sorted-list1Delete the first occurrence of the given element.  sorted-listDelete all" occurrences of the given element.  sorted-list