Tree coding In class, we have seen how to implement two types of rotation for AVL trees. There are still two more types of rotation that must be takled. The single rotate right and the double rotate left-right. First diagram these rotations on paper. If you show the rotation and steps as we have shown in class and hand this in, I will count it as a couple points of extra credit. This is to encourage you to 'do the right thing' in the sense that drawing this out on paper is the correct first step to implementation. Implement these final two rotations in the avl skeleton program. For testing, try long sequences of values from homeworks and test questions. Does your program do what you think it should be doing? For handin, choose a long sequence of values that tests all four types of rotations in several portions of the tree (some near the leaves after many insertions and some near the root after many insertions).