Starting with an empty bst, a sequence of n items is inserted into it, one at a time. the bst is not allowed to have any duplicate keys. what is the worst case big o running time to insert all n items? show your derivation. count item-to-item comparisons towards running time. (first get the answer in number of comparisons, then translate to big o).