Question: In Ocaml, write a recursive function that takes two lists as arguments and returns a list containing all items that appear in either list with
In Ocaml, write a recursive function that takes two lists as arguments and returns a list containing all items that appear in either list with no duplicates. ( You can assume that each of the arguments contains no duplicates, but there mat be items that appear in both lists). DO NOT USE ANY BUILT IN LIST FUNCTIONS
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
