Short Answer Questions Analyze the time complexity of insertion to a sorted array-based list. You need to give the big-0 time complexity and corresponding analysis. 1. 2. There is a sequence of numbers: (13, 3,10,12,2,1,9,6,7,15, 5, 8,1411, 4). Suppose you have an empty binary search tree then add the numbers one by one from the sequence in order. (You only need to give the final status of the tree) 3. Making the following AVL tree balanced (You only need to give the final status of the tree) 96 85 90 64 36 4. A heap is stored in an array. a. Draw the heap based on the given array. Suppose this heap represents a queue. b. Then dequeue one element from this queue. Draw the tree after dequeue and reheapdown 15 11 14 910 13 78 4 2 5 12 16 13 11 For this given array, use merge Sort to sort this array. You need to give the status of every step. 5. (13, 3, 10, 12, 2, 1, 9, 6, 7, 15, 5, 8, 14, 11, 4 6. Print this tree using postorder, inorder, and preorder traversals. Mark them clearly which output is from which order