input: Write a function to recursively solve the "Tower of Hanoi" game for any given number of disks. The function should print the sequence of moves required to move the disks from the start rod to the end rod. The function should take in the number of disks and the names of the start, end, and auxiliary rods as parameters.
  assert solveTowerOfHanoi(3) is None
  assert solveTowerOfHanoi(4) is None
  assert solveTowerOfHanoi(1, 'X', 'Y', 'Z') is None
  assert solveTowerOfHanoi(2, 'A', 'B', 'C') is None
  assert solveTowerOfHanoi(0) is None
output: def solveTowerOfHanoi(n, start, end, aux):
      if n == 0:
          return
      solveTowerOfHanoi(n-1, start, aux, end)
      print(f"Move disk {n} from {start} to {end}")
      solveTowerOfHanoi(n-1, aux, end, start)