Haskell function that takes two lists sorted in ascending order and merges them into one sorted list.

Write the function merge :: Ord a => [a] -> [a] -> [a]. Merge takes two lists sorted in ascending order and merges them into one sorted list. Lists can be of unequal length and may be empty. For example:

merge [1,3,5] [2,4] ? [1,2,3,4,5]

merge [1,10] [2,2,2] ? [1,2,2,2,10]