Write the recursive algorithm of the Tower of Hanoi in Java.

Problem: Move 3 Disks from Spindle A to C using B

Algorithm: Assume we have N disks

1. Move N-1 disks from A to C using B

2. Move last disk on A to B

3. Move N-1 disks from C to B using A

Requirements: Spindle Class

Disc Class

Main