## Interleaved Towers of Hanoi

In this classical variation of the Towers of Hanoi, you are given 4 pegs with 2 stacks, one white and one black. You should mix the two stacks as depicted in the Objective world. As previously, you cannot move a disk on a smaller disk.

You will probably need to reuse the `hanoi()` method that you wrote in the previous exercise.

If your initial situation is as follows:
then you have the following situation right before the main recursive call: