Question 3: (Trees) 9. Traverse the given tree using Inorder, Preorder and Postorder traversals. 10. Show how to remove the node with the value 40 from the following binary search tree. Draw the resulting tree. 11. Draw the binary search tree that would result from the insertion of the following integer keys: 14 58 18 10 99 52 33 69 74 17. 12. Generate parse trees for the following expressions. 1. II. III. (A+B)(D/E) (A+B^D)/(D-F)+G A (B+D)/E-F* (G+H/K) 13. Represent all the trees shown in questions 9 and 10 by using arrays.