text: 
  #https://www.geeksforgeeks.org/c-program-for-tower-of-hanoi/
  # Recursive Python function to solve tower of hanoi
  
  def TowerOfHanoi(n , from_rod, to_rod, aux_rod):
  	if n == 1:
  		print("Move disk 1 from rod",from_rod,"to rod",to_rod)
  		return
  	TowerOfHanoi(n-1, from_rod, aux_rod, to_rod)
  	print("Move disk",n,"from rod",from_rod,"to rod",to_rod)
  	TowerOfHanoi(n-1, aux_rod, to_rod, from_rod)
  		
  # Driver code
  n = 4
  TowerOfHanoi(n, 'A', 'C', 'B')
  # A, C, B are the name of rods
  
  