Rehashing requires recomputing the hash function for all items in the hash table. Since co...

Rehashing requires recomputing the hash function for all items in the hash table. Since computing the hash function is expensive, suppose objects provide a hash member function of their own, and each object stores the result in an additional data member the first time the hash function is computed for it. Show how such a scheme would apply for the Employee class in Figure, and explain under what circumstances the remembered hash value remains valid in each Employee.

Figure Example of a class that can be used as a HashedObj