For each of the following computations, write the worst case complexity (using big O notation) and indicate when the worst case happens (under what conditions).

Computation Worst-Case Complexity in notation) When does the worst case happen (under what conditions) Sorting an array of lengin Nusing the Inscrtion Sort algorithm. Inserting a node in an ordered linked list of N nodes (keeping the list ordered after the insertion). Merging two sorted sub-arrays cach of size 1/2 to obtain a single sorted array of size N. Deleting a node from a balanced binary scorch tree of N nodes. Searching for an item in a hash table that uses separate chaining for resolving collisions, assuming the hash table is of length and the total number of items currently in the table is N