Haskell Question

A) The sum of the integers between 1 and 100 can be expressed using the list comprehension notation as sum [X | X Int -> Bool that decides if one integer is divisible by another, e.g. divides 15 2 is False and divides 15 3 is True. Using a list comprehension, define a function divisors :: Int -> [Int] that returns the divisors of a natural number. For example, divisors 15 should give (1,3,5,15]