Resolve using the Haskell programming language.

5. (BONUS - 2 points) Write a tail-recursive version of List.fold_right without using (or re-implementing either of these; your function should make just one pass over the list). Other than tail recursion, your function should behave identically to List.fold_right. You may use recursion for this question only. Hint: Try changing the function you pass to the recursive application. Note: This, like other bonus tasks we'll occasionally include in assignments, is quite difficult and is worth a small number of bonus points. Try it for an extra challenge if you want (probably after completing the rest of the assignment)