Each item below is a description of a data structure, its implementation, and an operatiorn on the structure. In each case, choose the appropriate running time from the list below. The variable n represents the number of items (keys, data, or key/data pairs) in the structure. In answering this question you should assume the best possible implementation given the constraints, and also assume that every array is sufficiently large to handle all items. Please use the scantron sheets for your answers (b) O(log n) (c) O(n) (d) O(n log n) (e) None of these running times is appropriate. (MC 9) (MC 10) (MC 11) (MC 12) (MC 13) Enqueue for a Queue implemented with an array. Dequeue for a Queue implemented with an array. Worst case for insertion into a Binary Search Tree Worst case for removal from a Binary Search Tree Worst case for an algorithm to return all keys that are greater than 20 and that are multiples of 3 in a Binary Search Tree Worst case for insertion into an AVL Tree Worst case for an algorithm to return all keys that are (MC 14) (MC 15) greater than 20 and that are multiples of 3 in an AVL Tree Level order traversal of an AVL Tree Build an AVL tree with keys that are the numbers between (MC 16) (MC 17) 0 and n, in that order, by repeated insertion into the tree. (MC 18) Build a binary search tree with kevs that are the numbers between 0 and n, in that order, by repeated insertion into the tree