申論題

8. (15%) In the hash method, suppose that a rehash function hi(x)-(5i+x) mod 13 is applied sequentially when a new element is inserted into the hash table, but a hash colision occurs. In other words, h₁( ) is applied for the first time; h₂( ) is applied if a hash collision occurs; h₃( ) is applied if a hash collision occurs again; and so on. What is the content of the hash table after the elements 35, 22, 9, 24, 16, 19, 3, are inserted sequentially into an empty hash table of size 13, indexed as 0 through 12 ?