Cuckoo hashing's lookup and insert guarantees vs. load factor

A cuckoo hash table has two arrays T1 and T2 of m slots each and two independent hash functions. Every key lives either at T1[h1(k)] or at T2[h2(k)], never anywhere else. Insert places the key at T1[h1(k)]; if that evicts an occupant, the occupant moves to its slot in the other array, possibly evicting another key, and so on. If the chain exceeds a step limit, the table is rebuilt with fresh hash functions. Load factor is n / 2m. Which statement about its guarantees is correct?

44 of 46 in Data Structures & Algorithms