Q1) Part A (9 points): Here is a small binary tree: 18 6 11 1 3 10 25 7 44 Write the order of the nodes visited in: a. An in-order traversal: b. A pre-order traversal: c. A post-order traversal: Part B (10 points): Suppose you have the following binary search tree. 10 16 a. Add number 5: Show how number 5 will be added in term of comparisons. b. Draw the tree after adding 5. c. Write the function that will add a node to BST. d. Write the function that will delete a node from the BST. e. Draw the tree after deleting 20