19) When hashing: A) chains can be secondary hash tables whose chains are stored in hash tables, etc. B) chains could be high-probability ordered with few to no problems C) chains should be made of sturdy titanium links D) a good hash table will detect when chains grow too long and rebuild itself E) when you are probing and run out of empty table slots, just start a chain from the last spot 20) Explain the process of inserting a new key value into a heap. 21) TRUE/ FALSE When probing to relieve hash table collisions, the 'increment should be relatively prime to the size of the table. TRUE/FALSE When rebuilding a hash table to reduce chain length, the new table size should be relatively prime to the old table size. 22) An adaptable priority queue allows changes to be made to data within the queue. In particular we can A) change all keys associated with a particular value B) change the key associated with a particular value C) change the value associated with a particular key D) remove a key that doesn't have highest priority E) remove a value from a key