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 (-5[1])of items equal to the (*) load (-5[1])factor (10[1])must be (10[1])swapped. (10[7]-5[2])A scheme (10[1]-5[1])named for (10[1])cuckoos (10[2])that implements (10[1])many of (10[1])these data structures (-5[1])has worst-case constant lookup (-5[1])time. (10[2])Python’s built-in (10[2])dict type implements (10[2]-5[1])this data structure. (10[1]-5[3])Linear (10[1])probing can be used to resolve collisions in these data (10[1])structures. For 10 points, (10[1])name these data structures that implement a one-way mapping to store key-value pairs. (10[3])■END■ (10[5]0[13])