Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. ( Please fill the answers in the same sequence as appear below. ) Delete in a Binary Search Tree of size N. 2. Insert in a Splay Tree of size N. Inserting a value into an AVL tree of size N. 4. Post-order traversal of a Binary Search Tree containing N elements. 5. Given a binary min heap, find which value is the minimum value and delete it.