Please help me in Haskell code

(4) Define functioncommonDivthat receives two numbers as input, and returns the list of all common divisors of those two input numbers. For example if the inputs are 24 and 30, the output would be[1,2,3,6]. You may use list comprehension and function-divisor defined earlier.Hint:Given numbers n and m, generate the list of divisors of these numbers and only keep the intersection.

(5) Define functiongreatestCommonDivthat receives two numbers as input and returns the greatest common divisor of those two input numbers. For example, if the inputs are 24 and 30, then the output would be 6. You may use maximum function along withcommonDivdefined earlier.Note: function gcd is already part of standard library. Do not use that! Hint:Given numbers n and m, callcommonDivon them and return the biggest element of that list.

-----

Example : len xs = sum [1| _ <- xs] -- length of the list