Data Structures Homework in Java -

Referenced wiki links:

1 - https://en.wikipedia.org/wiki/Tower_of_Hanoi

2 - https://www.cs.cmu.edu/~cburch/survey/recurse/hanoiimpl.html

Your Task: For this homework, you will write a program to solve the puzzle of Tower of Hanoi. To learn about the puzzle, go to the link below Wikipedia-Tower of Hanoi Tower of Hanoi can be solved using a recursive algorithm, to learn about the algorithm, you can read about it in Wikipedia or visit the link below. Writing a Towers of Hanol program Traditionally Tower of Hanoi is played on 3 pegs with any number of disks. To make this homework more chanllenging (and fun), we will test your program with 3, 4 and 5 pegs with any number of disk All cases with 3 pegs: 40 points All cases with 4 pegs: 40 points All cases with 5 pegs: 10 points Your code is elegant and follows the assignment specification: 10 points Your code is elegant and tollows the assignment points