3.(a) Construct a binary search tree using the following key values: 29 31 17 2116 40 28 Show the dummy nodes as well. (b) Now give the pre-order, post-order and in-order traversal order from the above tree. (c) Illustrate how you would add the following into the tree: 24 (d) Ilustrate how you would delete the following key: 29 (root) e) From the original tree, show the process of searching the following data: 21, how many searches will be needed