Problem 1 Suppose we represent sets of integers as lists of integers with no duplicated elements. Write Prolog rules for the following set operations (do NOT use any pre-defined predicates): subset (A,B): returns true if set A is a subset of set B; false otherwise. union(A,B,C): returns the union of sets A and B. C is used to store the result. intersection(A,B,C): returns the intersection of sets A and B. C is used to store the result difference(A,B,C): returns the set difference of sets A and B. C is used to store the result Here are few examples of queries and expected responses of the Prolog interpreter: ?- subset([1,3,5], [5, 1, 2,3) yes ?- subset([1,3,5], [3,1,5]). yes ?- union(|1, 2,3], [2,3,7,9], U) ves, U1,2,3,7,9] 7-intersection([1, 2, 3], [2, 3, 7, 9], ). yes, 1=[2,3] ?- difference([1,2,3], [2,7,9,3], D yes, D 1