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)

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 o(l) O O(log n) O O(n) O O(n login) O O(u2) d. 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) O o(l) O O(log n) O O(n) O O(n login) O O(u2) 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 o(l) O O(log n) O O(n) O O(n login) 0 0() 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 o(l) O O(log n) O O(n) O O(n log in) O O(u2) g. What is the load factor of a Hash Table. O O 0 0 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