Answer each of the following: no explanations required What is the worst-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted array? a. b. What is the best-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted array? What is the worst-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted linked list? c. d. What is the best-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted linked list? A rehash operation in an open addressing hash table where quadratic probing is used to resolve collisions. Assume original tablesi = 3N (before re-hashing), new tablesize- N3 and there are currently N items in the hash table. e. Find in a separate chaining hash table where each bucket points to a binary search tree. Assume: tablesize N and there are currently N items in the hash table. f. Find the maximum value in hash table where linear probing is used to resolve collisions. Assume: tablesize- N and there are currently N items in the hash table. g