input: Write a python function to solve the Tower of Hanoi problem, which prints the steps to move disks from the start rod to the end rod.
  assert solveTowerOfHanoi(2) == None  # Expected output:
                                       # Move disk 1 from rod A to rod B
                                       # Move disk 2 from rod A to rod C
                                       # Move disk 1 from rod B to rod C
  
  assert solveTowerOfHanoi(3) == None  # Expected output:
                                       # Move disk 1 from rod A to rod C
                                       # Move disk 2 from rod A to rod B
                                       # Move disk 1 from rod C to rod B
                                       # Move disk 3 from rod A to rod C
                                       # Move disk 1 from rod B to rod A
                                       # Move disk 2 from rod B to rod C
                                       # Move disk 1 from rod A to rod C
output: def solveTowerOfHanoi(n, start_rod='A', end_rod='C', auxiliary_rod='B'):
      def moveDisks(n, start_rod, end_rod, auxiliary_rod):
          if n == 1:
              print(f"Move disk 1 from rod {start_rod} to rod {end_rod}")
              return
          moveDisks(n-1, start_rod, auxiliary_rod, end_rod)
          print(f"Move disk {n} from rod {start_rod} to rod {end_rod}")
          moveDisks(n-1, auxiliary_rod, end_rod, start_rod)
  
      moveDisks(n, start_rod, end_rod, auxiliary_rod)