Please solve this problem in Java

Towers of Hanoi

There are times when using recursion leads to a more elegant solution than iteration. This is one of those cases. The Towers of Hanoi is one of the classic problems every budding computer science student must grapple with. Legend has it that in a temple in the Far East, priest are attempting to move a stack of golden disks from one diamond peg to another. The initial stack has 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stamp from one peg to another under the constraints that exactly one disk is moved at a time and at no time may a larger disk be placed about a smaller disk. Three pegs are provided, one being used for temporarily holding disks. Supposedly, the world will end when the priests complete their task, so there's little incentive for us to facilitate their efforts. For more information, go to https://en.wikipedia.org/wiki/Tower_of_Hanoi

Write a recursive program to solve the Towers of Hanoi puzzle. The puzzle involves manipulating disks that you can move between 3 different towers. You are given 4 disks stacked on three towers. The disks have decreasing diameters, with the smallest disk on the top.