Question Instructions: For the operation listed below, determine the time complexity of the operation, and choose from the selections provided. 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. What is the worst-case cost of resizing a HashMap that uses linear probing with a bad hash function? O(1) O(nlogn) O(n2) O(n) O(logn) Question 2 2 pts Question Instructions: For the operation listed below, determine the time complexity of the operation, and choose from the selections provided. 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. What is the worst-case cost of rebalancing the root node of an AVL Tree if the root node's balancing factor is 2 , and the heaviest child's balancing factor is -1 ? O(1) O(n2) O(n) O(nlogn) O(logn) Question Instructions: For the operation listed below, determine the time complexity of the operation, and choose from the selections provided. 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. What is the worst-case cost of creating an array-backed Min-Heap from a LinkedList of data sorted in ascending order? \begin{tabular}{l} O(nlogn) \\ \hlineO(n) \\ \hlineO(logn) \\ \hlineO(1) \\ \hlineO(n2) \end{tabular} Question 4 2 pts Question Instructions: For the operation listed below, determine the time complexity of the operation, and choose from the selections provided. 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. What is the average-case cost of finding an arbitrary key value pair in an array-backed HashMap that: - Uses quadratic probing; and, - Uses the hash function H( key )=0 ? O(n2) O(n) O(nlogn) O(1) O(logn)