1. What is the worst case time complexity of insertion into a binary search tree with n elements? You should use the most accurate asymptotic notation for your answer. 2. A binary search tree is given in the following. Draw the resulting binary search tree (to the right of the given tree) after deleting the node with key value 8. 10 3. You have a sorted array B with n elements, where n is very large. Array C is obtained by inserting vlog n elements into array B in some random order. Your job is to sort array C. Among the sorting algorithms studied in class, which algorithm is the most suitable one for this job (worst-case running time is the metric)? Justify your