Given (list comprehension) translate the list comprehension into Haskell code:

4. Given the following list comprehension: pullback:: (Eq b) => (a->c) -> (b->c) ->[a] -> [b] -> [ (a, b)] pullback fg as bs = [ (x,y) | X (a->c) -> (b->c) ->[a] -> [b] -> [ (a, b)] pullback fg as bs = [ (x,y) | X