Haskell

1.cycleN :: Int -> [a] -> [a)] Write a function that takes a number n and a list l and return a list containing the elements of 1 repeated n times Examples: cycleN [1..10] LJ >cycleN 5 "hello" "hellohellohellohellohello" Permitted functions: (-), (++) 2.countLessThan (Ord a) >a - [a] -Int Write a function that takes a value and a list and returns the number of items in the list less than the provided value. Examples: countLessThan 10 O..20] 10 countLessThan 'g "supercalifragilisticexpialidocious" 10 Permitted functions:(+),()