The following incomplete algorithm is intended to solve the Towers of Hanoi problem. The “Move-Disks” function takes the number of disks to be moved (Num_Disks), source tower (From_Tower), destination tower (To_Tower), and the other/third tower (Other_Tower) as the input parameters and solves the problem.

Move-Disks (Num_Disks, From_Tower, To_Tower, Other_Tower)
  if (Num_Disks == 1):
      Move the disk on the top of From_Tower to To_Tower
  else:
      .......(A).......
      Move the disk on the top of From_Tower to To_Tower
      .......(B).......

What will be the most suitable parts to fill the blanks A and B, respectively, so that the algorithm will solve the problem of Towers of Hanoi?