In JAVA with detailed comments and only 3 classes

Assignment 7 part 1 Research and implement the Towers of Hanoi. This is a discussion I wrote about recursion: Recursion When I first encountered recursion I thought: "This is simple, a function that calls itself. Naturally, I was soon confused and wondering what hit me - I had a new appreciation of the difficulties inherent in recursive processes. Over the years I mastered recursion and then had to teach it. I did not realize at first thatI had a mental image that the students did not have. That image, which TOTALLY explains recursion, is the function as it resides on the program stack. Let me explain the program stack and then show how that applies to recursion.. Every executable's main is loaded into a program stack at the beginning of execution. It remains there until it completes, at which time it is popped off of the stack. Initial Empty Stack Stack while main executes main I will not go into all the details of what is in the stack as this will just cloud the discussion. If main calls a function, that function is loaded onto the top of the stack and remains there until it is complete at which point it is popped off of the stack. Stack after main calls f Stack after fcompletes main main Now, a recursive function calls itself. That means another instance of the function will be placed on the stack and will remain there until the function completes