Java project

Towers of Hanoi (15 points) Given: n disks, all of different sizes the size of the i disk is i 3 pegs - A, B, C the number of pegs might change in a future version of the game Initially, all the disks are stacked on peg A Requirement: Never place a larger disk on top of a smaller disk (disk 5 is larger than disk 4, etc.) Objective: Move the disks from peg A to peg C Input: n, the number of disks initially stacked on peg A; you should get n from the command line, as a command line argument; assume n