2 0 1 6 2 29 072 6 Figure 1 (a) Fill in the above array (the empty spaces) with your cell phone number (sequentially). (b) Create a Binary Search Tree (BST) after inserting each value (from left to right) of the above array (Figure 1) and re-draw the tree after inserting each value. (c) Delete the root of the tree and re-draw the new tree. (d) Visit the final Binary Search Tree and print the values of the tree using preorder and inorder traversal part 02 Create a max heap after inserting each value (from left to right) of the above array (Figure 1) and re-draw the heap after inserting each value. Delete the root node of the heap (created in previous question) and show the final heap (after deletion)