Please answer asap. Data Structures

Match the following with their Worst-Caae time complexity. Inserting an element into an array of size n. A. O(logn) Sorting an array of size n with Bubble-sort. . O(nlogn) Adding two nn matrices. C. O(nA3) Finding an item in an array of size n. D. O(n2) Getting an element by index from an array of size n. E. O(1) Sorting an arxay of size n with Insertion-Sort. F. O(n) Sorting an array of size n with Selection-Sort. Finding the largest value in an array of size n. Multiplying two nx matrices. Deleting an element in an array of size n