úÎD B      NoneNType of sorted lists. Any (non-bottom) value of this type is a sorted list.O(1)e. Decompose a sorted list into its minimal element and the rest. If the list is empty, it returns . Create a  by sorting a regular list.O(1). Create a list from a 2. The returned list is guaranteed to be sorted.O(1)-. Create a sorted list with only one element.FAn infinite list with all its elements equal to the given argument.3Replicate a given number of times a single element.Dual (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.¦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)) O(n)(. Insert a new element in a sorted list. 1Delete the first occurrence of the given element. <Extract the prefix with the given length from a sorted list. rDrop the given number of elements from a sorted list, starting from the smallest and following ascending order. žSplit a sorted list in two sublists, with the first one having length equal to the given argument, except when the length of the list is less than that.O(n)”. Divide a sorted list into two lists, one with all the elements that satisfy the given predicate, and another list with the rest of elements.O(n)<. Extract the elements of a list that satisfy the predicate.O(n)!. An efficient implementation of  , using the £ instance of the elements in a sorted list. It only traverses the whole list if the requested element is greater than all the elements in the sorted list.O(n)/. Remove duplicate elements from a sorted list.DMap a function over all the elements of a sorted list. Note that / will hang if the argument is an infinite list. Even though  can't be made an instance of ,  does hold the O laws (for finite lists). We can't however write an instance because of the Z instance requirement on the type of the elements of the result list. Therefore, while ^ is not a functor type in general, it is when restricted to elements of orderable types.The complexity range goes from O(n)5 (if the function is monotonically increasing) to O(n²){ (if the function is monotonically decreasing). These are the best and worst case scenarios. We provide an alternative (I) where monotonically decreasing functions are the best case scenario. Just like q, but favoring functions that are monotonically decreasing instead of those that are monotonically increasing.O(n)). Reverse a sorted list. The result uses  X, thus it is a sorted list as well. The following equality holds for any sorted list xs: map Down xs = reverse xsOnly available from base version 4.6.0.0.O(n)6. Reverse a sorted list with elements embedded in the   type.Only available from base version 4.6.0.0.uReturn the longest prefix of a sorted list of elements that satisfy the given condition, and the rest of the list.XReturn the longest prefix of a sorted list of elements that satisfy the given condition.nReturn the suffix remaining after dropping the longest prefix of elements that satisfy the given condition.UReturn the indices of all elements in a sorted list that satisfy the given condition. !" #$%&  !" #$%&'      !"#$%&'()*+,-.sorte_AO2og8d7VZOG7xUX9MfI0IData.SortedList SortedListuncons toSortedListfromSortedList singletonrepeat replicateunfoldriterateinsertdeletetakedropsplitAt partitionfilterelemOrdnubmapmapDecreverse reverseDownspan takeWhile dropWhile findIndicesbaseGHC.BaseNothing Data.FoldablefoldrJustelemghc-prim GHC.ClassesOrdFunctorData.OrdDownmergeSortedLists$fFoldableSortedList$fMonoidSortedList$fNFDataSortedList$fShowSortedList