language: Haskell

5. For the purposes of this question, assume that the name "orderedPairs" refers to a list of all possible ordered pairs of integers, in RANDOM ORDER, where each component is between 0 and 5, inclusive. Using "orderedPairs" as a generator, write a list comprehension that produces a list of all possible ordered pairs of integers (in the order they appeared in the generator) for which the sum of the components is 6 and the first component is less than the second. You may use the fst and snd selector functions for this question if you wish, but your solution must be a list comprehension and cannot 12.0 marks] rely on any other functions 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. [4.0 marks] 6. 5. For the purposes of this question, assume that the name "orderedPairs" refers to a list of all possible ordered pairs of integers, in RANDOM ORDER, where each component is between 0 and 5, inclusive. Using "orderedPairs" as a generator, write a list comprehension that produces a list of all possible ordered pairs of integers (in the order they appeared in the generator) for which the sum of the components is 6 and the first component is less than the second. You may use the fst and snd selector functions for this question if you wish, but your solution must be a list comprehension and cannot 12.0 marks] rely on any other functions 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. [4.0 marks] 6