It tests your knowledge of some of the fundamental Prolog programming techniques.
All answers are to be writtten in NU-Prolog.
Please take care to follow the specifications exactly, including using the right procedure names. Answers should be e-mailed to Lee from your CS account on or before Monday September 10th. Mail the plain text version of your .nl file. Only one solution should be returned and the order of permutations is arbitrary. The most efficient way is to use recursion and accumulators.