1) A) Draw a BST tree of array A = [3, 8, 10, 1, 6, 9, 2, 11], by using in order traversal algorithm. Then, delete the node [6] and show the final AVL tree by inserting two nodes [20,21]. (Do not forget, if you need to do a rotation in each step, write the related pseudocode.) B) By using the last configuration of array A, draw a Heap tree, then remove the smallest node and redraw the Heap tree