2. Give an analysis of the time complexity (use O-notation) for each of the following program segments by showing the steps (Assume all variables used have been declared): 3. Given a list of keys {17,15,16,10,8,29,20,27,2,3,6}, show the results of sequentially inserting them into an initially empty AVL tree. Show your steps clearly. 4. Show the results of accessing the keys 3,9,1 in order in the splay tree shown in the following figure. Show your steps clearly. 5. Suppose you insert 7 elements into a binary search tree. What are the possible heights after the insertions? Explain your answer. 6. For the following expression, 5+8(32)610/2 (i) Convert to the corresponding postfix expression. Show your steps clearly. (ii) Build the expression tree and show the result of preorder traversal