For each of the operations listed below, determine the time complexity of the operation. Select the bubble corresponding to your choice in the space provided. Unless otherwise stated, assume the worst-case time complexity. However, make sure you choose the tightest Big-O upper bound possible for the operation. Do not use an amortized analysis for these operations unless otherwise specified When appropriate, m is the length of the pattern, n is the length of the text, and k is the length of the longest number in digits A.) Running insertion sort on an array given in descending order. O 0(1) O O(log n O(n) O(n log n O O(n2) B.) Running Boyer-Moore when no character in the text exists in the pattern O 0(1) 0 0(n) 0 0(n/m) O O(n m) O O(nm) C.) Adding to a 2-4 Tree O o(1) O O(log n) O(n) O O(n log rn) O O(n2) D.) Worst-case of running put0 on a HashMap backed by external chaining, where the map uses 2-4 trees in place of linked lists. Assume no resizing O 0(1) O O(log n) O O(n) O O(n log n) O 0(n2) E.) Worst-case of running quicksort on an already sorted array. O 0(1) 0 0(log n) 0 0(n) O O(n log n) O O(n2)