The towers of Hanoi problem is based on the following legend:

In a Far Eastern monastery, there is a puzzle consisting of three diamond needles and 64 gold disks. The disks are of graduated sizes. Initially, the disks are all stacked on a single needle in decreasing order of size. The monks are attempting to move all the disks to another needle under the following rules:

a. Only one disk may be moved at a time.

b. No disk can ever rest on a smaller disk.

Legend has it that when the task has been completed, the universe will end.

Write a LISP program to solve this problem. For safety’s sake (and to write a program that will finish in your lifetime) do not attempt the full 64-disk problem. Three or four disks is more reasonable.