1) Draw the binary search tree (BST) that results from inserting the values 1 to 7 in each of the following orders (reading from left to right): A) 1 2 3 4 5 6 7 B) 5376214 C) 43 52617 Then draw AVL tree of each BST that order on above rows, by inserting two nodes 10, 20. By using the last configuration of A, B and C tree, draw a Heap tree, then remove the smallest node and redraw the Heap tree. 2) Write an algorithm that takes as input an array, and returns the array with all the duplicate elements removed. For example, if the input array is {1, 3, 3, 2, 4, 2, 5, 5), the algorithm returns (1, 3, 2, 4,5). 3) Write the list of vertices that visited by running a breadth-first search (BFS) and a depth- node. 4) Run Dijkstra's algorithm on the weighted graph below, using vertex A as the source. Write the vertices in the order which they are marked. 10 12 11