Efficient implementations of inverted memory paging use this data structure to store [emphasize] virtual page numbers. Protocols named for their similarity to this data structure, such as Kademlia and the Content Addressable Network, organized peer-to-peer systems by providing one “consistent” or “rendezvous” service. The birthday paradox gives an estimate of how early this data structure may need to apply resolution techniques like linear probing. (10[2])Assuming a low load factor, this data structure’s lookup and insertion procedures take “big-O of one” time on average, but worst-case performance may be linear-time (10[1])due to collisions. For 10 points, the Python dictionary type implements what data structure, which is named after functions that map keys to uniformly distributed array indices? ■END■ (0[1])