well i got that... I dont think my interpreter is working... could you guys check these out maybe?
2. Write a Prolog program named min so that min(L,M) is true if M is the smallest element in the list L.
3. Write a Prolog program such that p(X) is true if X is a list consisting of n a's followed by n b's, for any n >= 1.
4. Write a Prolog program named mkset(Xs,Zs) which will be true if the list Zs is a list of the elements of Xs with any duplicates in Xs removed. The list Zs is a set, so the elements of Xs in Zs should occur at most once.
5. You are given the following Prolog predicates such as those below representing a database of countries and cities.
Give a Prolog predicate that will:
a. Answer those countries that have cities with the same name as capitals of other countries?
b. Answer those countries where more than 1/3 of the population lives in the queried city?
6. Write a Prolog predicate that extracts all numbers that are greater than and follow a given number in a list of numbers. The empty list is returned if the number does not appear in the list, or the number is the only number in the list, or all elements in the list are less than the number.