using Haskell; A triple (x, y, z) of positive integers is pythagorean if x² + y² = z². Using a list comprehension, define a function pyth which returns the list of all pythagorean triples whose components are at most a given limit. For example, function call pyth 10 should return [(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]

provide the code and the test