In Prolog please

For all problems below, you only need to make sure that the predicates correctly find the first solution, as in the examples provided. You do NOT need to worry about what happens when asking for more solutions (with"". (56 pts) Consider an implementation of sets with Prolog lists. A set is an unordered collection of elements, without duplicates 1. (a) (14 pts) Write the rules for a predicate isSet (S), which succeeds if the list S is a set. The following queries show examples of using this predicate: ?- isSet ([1,2,5]) Yes ?- isSet ([1,2,1,5]) No