Consider two binary search trees, T1 and T2, which contain the same set of keys, {1, 2, ..., n}. The goal is to transform T1 to T2 using only rotations. Sketch a general method for doing this, ensuring that the binary search tree property is maintained. Please first clearly define the rotation procedures in your solution.