This project tests your knowledge of some more advanced Prolog programming tools and techniques. Note that you are required to solve coding problems in a particular way - it is not just correctness and efficiency which are being assessed.
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 on or before Monday October 8th. If some recursion cannot be eliminated, explain why it does not fit the pattern of one of these higher order predicates. Note that the answers of your program should be identical to those of the program above, including the order of permutations returned. Note that the answers of your program should be identical to those of the program above, including the order of permutations returned.