P.S. they are from the same question, just different parts.

Please solve the mutiplte choices. (include explanation if needed)

a. What is the average-case time complexity for insert in a Hash Table O oi) O O(log n) O O(n) O O(n log n) b. What is the average-case time complexity for find in a Hash Table O oi) O O(log n) O O(n) O O(n log n) What is the worst-case time complexity for insertion in a Hash Table using Separate Chaining (assume a Linked List is used in the bucket implementation) c. O oi) O O(log n) O O(n) O O(n log n) What is the worst-case time complexity for find in a Hash Table using Separate Chaining (assume a Linked List is used in the bucket implementation) d. O oi) O O(log n) O O(n) O O(n log n) What is the worst-case time complexity for insertion in a Hash Table using a Hash Table using Separate Chaining (assume a BST is used in the bucket implementation) e. O oi) O O(log n) O O(n) O O(n log n) f. What is the worst-case time complexity for find in a Hash Table using Separate Chaining (assume a BST is used in the bucket implementation) O oi) O O(log n) O O(n) O O(n log n) g. What is the load factor of a Hash Table. The minimum number of elements you need to insert before the Hash Table performs optimally The ratio #inserted elements/current size of hash table It represents the maximum number of elements you can insert in your hash table The ratio #inserted elements/#collisions The ratio #occupied hash values/current size of hash table O O O