I have a-d complete. Please do e-g

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 ina dictionary implemented with a sorted array? c. What is the worst-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted linked list? d. What is the best-case asymptotic running-time for the best algorithm for finding something ina 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 taee-3N (before re-hashing), new tablesizesW3 and there are currently N items in the hash table e. f. 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. Find the maximum value in hash table where linear probing is used to resolve collisions. Assume: tablesize 2N5 and there are currently N items in the hash table. g. 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 ina dictionary implemented with a sorted array? c. What is the worst-case asymptotic running-time for the best algorithm for finding something in a dictionary implemented with a sorted linked list? d. What is the best-case asymptotic running-time for the best algorithm for finding something ina 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 taee-3N (before re-hashing), new tablesizesW3 and there are currently N items in the hash table e. f. 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. Find the maximum value in hash table where linear probing is used to resolve collisions. Assume: tablesize 2N5 and there are currently N items in the hash table. g