As operations are applied to a splay tree, it becomes more and more balanced. Show that this is not necessarily true by providing a sequence of search() operations that will turn any n node splay tree into a right-going chain. That is, in the resulting tree, all of the nodes are along the path starting at the root that keeps visiting the right child. Briefly justify your answer. Why does your example not contradict the amortized analysis?