how to proof that every two red black tree can convert to each other by 2n-2 rotations?

Question

for two red black trees with the same nodes that each has n nodes. how can we convert one of them to another just by 2n-2 rotation? I worke