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). The type signature of mergeBy is as follows. mergeBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]