is red-black tree is splay tree is binary search tree - perform the following sequence of operations in an initially empty splay tree and draw the tree after each set of operations insert keys in this order search for keys in this order delete keys in this order - what does splay tree look like if its entries are accessed in increasing order by their keysr- explain how to use an avl tree or red-black tree to sort comparable elements in (nlogntime in the worst case - can we use splay tree to sort comparable elements in (nlogntime in the worst casewhy or why notcreativity