Implement the Towers of Hanoi algorithm as a Java or Python method.

$$ Write a main method to test this, ensuring you can input the number of disks at

a minimum.

$$ You will also need to implement the moveDisk$($src$,$ dest$)$ method. This can

be as simple as an output statement printing "Moving disk from peg source to peg

destination" where source and destination are $1,2$ or $3.$

$$ Add indenting to your output to indicate the level of recursion.

#Towers of Hanoi Problemm

def moveDisk$($src$,$ dest$)$:

print$($f$"$Moving disk from peg $\{$src$\}$ to peg $\{$dest$\}")$

# prints the message indicating the move.

def towers$($n$,$ src$,$ dest, aux, level$=0)$:

if n $==1$: #bestcase senario

moveDisk$($src$,$ dest$)$

return $1$

count $=0$ #keep track of how many moves were made

count $+=$ towers$($n$-1,$ src$,$ aux, dest, level$+1)$

moveDisk$($src$,$ dest$)$

count $+=$ towers$($n$-1,$ aux, dest, src$,$ level$+1)$

return count

# Main method to test the Towers of Hanoi algorithm

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

n $=$ int$($input$("$Enter the number of disks: $"))$

print$("$

Towers of Hanoi Steps:"$)$

total$\_$moves $=$ towers$($n$,1,3,2)$ # $1,2,3$ are the names of pins

print$($f$"$

There are $\{$total$\_$moves$\}$ moves for this problem."$)$

Everything works except the count could you please fix that xx