Suppose the keys {1,2,3,4,6,9} are inserted into a hash table with collisions resolved by chaining.

Let the table have 3 slots, and the hash function be h(k) = k % 3, that is, h(k)
returns the remainder of the Euclidean division of k by 3. How will the keys be organized into this
hash table?
A. 1->4 B. 3->6->9 C. 3->4 D. 1
2->6 1->4 1->6 2->4
3->9 2 2->9 3->6->9

RESPONDER

Isabelly está aguardando sua ajuda, Clique aqui para responder.