in Haskell

Write a recursive function (including a type declaration) that takes a list of ordered pairs of integers as an argument and returns the same list you should receive from the list comprehension defined in 5 above. You may NOT use list comprehensions and you may NOT use any built-in functions, so your solution to this question may not call fst and snd unless you provide them yourself.