Tower of Hanoi problem

There are three bars and n disks with holes in the center are stacked like towers on A bars. I'm going to move this tower to the C-bar. Enter N and create a program that shows the process of moving this tower. However, the disk grows as the number goes up, and the large disk cannot go up on the small disk. Tip: Use a recursive function.

[Sam Chak]

Can you provide a sample code?