IN PROLOG : A set is represented as a sorted list without duplicates. Define predicates union(+set1, +set2, -union), intersection(+set1, +set2, -intersection), minus(+set1, +set2, - setDifference). Model them after the predicate merge. Examples of the expected behavior are given in the example code below. EXAMPLE CODE:.