(a) Determine the time complexity for efficiently finding an arbitrary item in an arbitrary binary search tree of n nodes (in e-notation). (b) Determine the time complexity for efficiently deleting an arbitrary item in an arbitrary binary search tree of n nodes, once the item has been located (in 0-notation). (c) Determine the maximum height of an arbitrary binary search tree of n distinct items (in e-notation). (d) Show the post-order traversal of the following binary search tree T: T: 16 21 20 22 44 40 81 96 G: 16 B (100) (e) Show the key comparisons that are necessary to search for the key 83 in the tree T given above. 10