All code should be written in Haskell

Problem 4. (5 points) Chapter 2. Write a recursive function factorial that computes the n factorial without using product. factorial: Int -> Int after reading Chapters 2 and 6] The n-th Lucas number In is recursively defined as follows: 10 = 2 and 11 1 and In-In-1 +In-2 for n > 2. Write a recursive function lucas that computes the n-th Lucas number lucas: Int -Int