The following schematic describes the left and right rotation operations on a frage- ment of a binary search tree. Circles represent nodes (as usual) and triangles represent sub-trees. A sub-tree will typically have one or more nodes but could be empty. RightRotate(y) LeftRotate(x) X Your task, should you choose to accept it, is to apply a LeftRotate operation at the node containing 15 on the tree below and draw the resulting tree. 8 15 11 17 10 16 18