Answer Happy

4. For each of the following algorithms or operations on data structures, mention the worst-case running time in asymptotic (big-O) notation. Justify your answer briefly. a) Inserting an item in a binary search tree b) Deleting an item from a sorted array c) Sorting N items using bubble sort