Describe an efficient dictionary structure for storing n entries whose r < n  keys have distinct hash codes. Your structure should perform operation find All in O(1+s) expected time, where s is the number of entries returned, and the remaining operations of the dictionary ADT in O(1) expected time.