Please write in Haskell with pattern matching

For this question, you will implement (under specific constraints) a recursive function in Haskell that takes a list of characters as an argument and returns a list that contains only every third element from the argument list in the same order. As a clarifying example, this function, when passed the argument list ABCDEFGHIJKLMNO, should return the list CFILO. It should also be noted that your function must work (i.e., not terminate with an error) even if the number of elements in the argument list is less than three.

You may NOT use the !! operator to complete this question, and you may NOT use any function that you havent written here (i.e., you may NOT use any built-in functions, but you may use other functions if you write them yourself).

Write this function (including a type declaration) without selector functions (even if you wrote them yourself), using only pattern matching.