Question 1: Use print this tree using preorder, inorder, and postorder Traversal on this tree, give all three traversals Question 2: 13] 45 31 17 23 87 A heap is stored in an array. 78 53 65 09 1) Draw the heap based on the given array. Suppose this heap represents a queue. 2) Then dequeue elements one by one from this queue until the queue is empty. Draw the status after every dequeue operation (totally 9 figures, you just need to give the status after dequeue operation and reheapdown operation) Question 3: AVL Tree Initial status is empty. Insert 50, 20, 60, 10, 8, 15 into this AVL tree in order. Draw every status of the tree