OCAML PROGRAMMING LANGUAGE ONLY

Write a recursive function called union that takes two lists as arguments and returns a list containing all items that appear in either list with no duplicates. You may assume that each or the arguments contains no duplicates, but there may be items that appear in both lists. You may use the member function dened in the previous problem, but you may not use any built-in list functions.