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 rely on any other functions.