Write a function append_fr : 'a list -> 'a list -> 'a list that returns a list containing the elements in the first list at the front of the second, with the order of the two lists preserved. Your function is required to use (only) forward recursion (no other form of recursion). You may not use any library functions, or @. # let rec append_fr list1 list1 = ...;; val append_fr : 'a list -> 'a list -> 'a list = # append_fr [1;3] [2;4];; - : int list = [1; 3; 2; 4]

Answer rating: 100% (QA)

Certainly Heres a function appendfr that achieves the described behavior using forward recur... View the full answer