For this project, you are to write a collection of lisp functions. The functions are to generate 100 pairs of integers (each between 1 and 1000), calculate the GCD of each pair, and sort by GCD. A driver function should return as its value an ordered list of pairs with their GCDs. (Note - remember to use recursion . . .)

Send a text file containing your functions to tom2 at astarte dot csustan dot edu.