Haskell Language Question

Suppose you are given a function divides :: Int -> Int -> Bool that decides if one integer is divisible by Define a function divisors :: Int -> [Int] that returns the divisors of a natural number. For example, divisors 15 should give (1,3,5,15). a. divisors a b - if a 'mod' b -- then True else False O b. divisors n = [xlx