Problem 3 [1 pt]. Do Problem 13.2-4 in the textbook CLRS (page 337). Show that any arbitrary n-node binary search tree can be transformed into any other arbitrary n-node binary search tree using O(n) rotations. (Hint: First show that at most n1 right rotations suffice to transform the tree into a right-going chain, and note that a right rotation will make the right side longer. I did discuss this during lecture but not in detail, so you should explain the transformation clearly, as well as explaining why the rotations are O(n)