1a)

Note: mergeBy accepts three arguments, the first of which is a comparison function of type (a -> a -> Bool) that determines in which way the list is to be sorted. Such comparison function that returns a Boolean value (true or false) is called a predicate.

1b)

(5 points) Define a recursive function mergeBy that merges two sorted lists by the given criterion, for example, in an ascending order or in a descending order, so that the resulting list is also sorted (by the given criterion). Type signature of mergeBy is as follows. mergeBy :: (a -> a -Bool) -[a] -> ta] -> a] (5 points) Define a recursive function mergeBy that merges two sorted lists by the given criterion, for example, in an ascending order or in a descending order, so that the resulting list is also sorted (by the given criterion). Type signature of mergeBy is as follows. mergeBy :: (a -> a -Bool) -[a] -> ta] -> a]