in haskell code (Not in Pseudo code)

Using recursion, write a function that takes a function and a list of Ints, and applies the function to every other element in the list (applies to first, skips the second, and so on), and adds either the transformed or untransformed element to the new list, returning a new list with both the unchanged and the transformed elements in their respective places.