solve 4-disk tower of Hannoi problem using paper and pencil. Hand in solution in java

Name 4 disks: D1, D2, D3, D4

Name the 3 pegs: T1, T2, T3

Create a table with three columns where you record your moves;

e.g. D1T1 D1GT3..

The 3rd column should record which disk(s) is/are on T3 at anyone time. When T3 has all the disks on it in the right order the puzzle is solved.