Using Java only!

The pseudocode to solve the Tower of Hanoi problem is as below:

FUNCTION MoveTower$($disk$,$ source$\_$pole, dest$\_$pole, spare$\_$pole$)$:

IF disk $==0,$ THEN:

$$ move disk from source$\_$pole to dest$\_$pole

ELSE:

$$ MoveTower$($disk $-1,$ source$\_$pole, spare$\_$pole, dest$\_$pole$)//$ Step $1$ above

$$ move disk from source to dest $//$ Step $2$ above

$$ MoveTower$($disk $-1,$ spare$\_$pole, dest$\_$pole, source$\_$pole$)//$ Step $3$ above

END IF

Convert this pseudocode into an actual program and determine the number of moves required to$$move n disks from the source$\_$pole to the destination$\_$pole where n is the user input.