Question :
Take screenshots of functions running in cLISP. Provide a description for each screenshot.
1. Create the function DecTree that will implement decision tree. Your function should accept input of decimal string (list) of repeated entries. Apply binary decision tree to find repetitions of each decimal digit in the string.
2. Let's have n disks of graduated sizes: D1, D2, D3,... Dn
3. In addition, let's have a 3 pegs, on which those disk could be stacked on: 1, 2, 3
4. If we know that all the disks are stacked on the peg 1, where the top disk is the smallest one while the bottom is the biggest, implement the functionalities that will do the following:
5. Move all the disks from the peg 1 to the peg 3, given that only one disk can be moved at a time and that no disk may be placed on top of a smaller one.