Create a new empty binary search tree. Insert 8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15, in that order. Show all keys of the tree in inorder traversal. Perform find1) and find(15) 100,000 times and record the CPU time taken by each of these. Compare the CPU times of #5 and #8, and explain how they are related to the best and worst- case running times of the find operation Remove key 8 and show the keys of the resulting tree (again, in inorder traversal)