Can anyone help me with the Tower of Hanoi problem with 4 pegs? The maximum number of disks is 100, and we don't need to optimize the number of moves. We need to print the number of moves and the moves, so we can't use too much moves. I can only solves when the number of disks is <=40;