Could someone help me draw these Trees ?

Part II (Paper based part):

Question 2:

[0] [1] [2] [3] [4] [5] [6] [7] [8]

87 78 53 45 65 09 31 17 23

A heap is stored in an array. 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, 25, 10, 5, 7, 3, 30, 20, 8, 15 into this AVL tree in order. Draw every status of the tree

Thanks!