Select all true statements below. Select one or more: a. In Separate Chaining, we can have more items than the number of buckets in the table. b. In Open Addressing, we can have more items than the number of buckets in the table. c. Inserting an item to a hash table that is 20% full and handles collisions using Double hashing takes always constant time. d. Inserting an item to a hash table that is 20% full and handles collisions using Linear Probing takes on average constant time. e. We can use hash table to implement a "Set" that allows operations insert(item), contains(item), and delete(item) in O(1) average time. f. We can use hash table to implement an ADT that allows finding minimum element in O(1) average time