3. [1] (a) Show the result of inserting 3, 10, 1,4,6, 2,9,5, 7 into an initially empty binary search tree. [1] (b) Show the result of deleting the root. 4. 12] Redraw the tree in question 5 below using a child/sibling link implementation. 5. 2] Show the queue state for the level order traversal of the figure below. Also, show the level order traversal circling your final