In 2021, Bender et al. proved that an optimal tradeoff curve for these data structures involves an exponential reduction in the number of wasted bits for each insertion. Ronald Rivest showed that the efficiency of partial-match retrieval algorithms based on these data structures is approximately equal to tree-search algorithms. David Karger introduced a method for resizing these data structures in which only a number of items equal to the (*) load (-5[1])factor must be swapped. (10[2])A scheme named for cuckoos (10[1])that implements many of these data structures has worst-case constant lookup time. (10[1])Python’s built-in dict type implements this data structure. (-5[1])Linear probing can be used to resolve collisions in these data structures. For 10 points, name these data structures that implement a one-way mapping to store key-value pairs. (10[1])■END■ (0[1])