Consider the hash table of size 12 that uses open addressing with linear probing. Let h(k) = k mod12 be the
hash function used. A sequence of records with keys 43, 63, 84, 11, 5, 72, 15, 16 is in stored into an initially
empty hash table, the bins of which are indexed from zero to 11.
The number of comparision for last element inserted is _________.
what would the answer be 2 or 3