Suppose we perform 1,000 insertions followed by 900 deletions in a Hash Table as defined in this section, then rehash. In what sense is the resulting data structure inefficient? The Hash Table class...

Suppose we perform 1,000 insertions followed by 900 deletions in a Hash Table as defined in this section, then rehash. In what sense is the resulting data structure inefficient?

The Hash Table class defined in this section can store only Comparable objects, because it implements the Set interface. What would we have to change to allow a Hash Table to store objects of any class? Would this same idea work for the Ordered List and Binary Search classes? Explain.