For this problem you must also go into XSB Prolog, implement each relation and then query it. Hand in a hard copy of your definitions as well as sample queries for each relation. Part of your grade will be determined by the choices of queries you make to test your code. L1 is a list of positive integers, and L2 contains the same elements as L1 but in non-increasing order. Then find the largest element of the rest, and move it to the next position, and so forth until you've sorted the whole list.
List is a ground list of numbers.
For this problem you must also go into XSB Prolog, implement each relation and then query it. Hand in a hard copy of your definitions as well as sample queries for each relation. Part of your grade will be determined by the choices of queries you make to test your code.