A hash-map has been constructed with double-hashing by applying h;(k;) = [h(k;) + jd(k;)] mod N. The primary hashing function is given as h(k;) hashing function as d;(k;) = k;divN where div is integer...

Extracted text: A hash-map has been constructed with double-hashing by applying h;(k;) = [h(k;) + jd(k;)] mod N. The primary hashing function is given as h(k;) hashing function as d;(k;) = k;divN where div is integer division. The maximum number of cells probed is N = 13. How many cells will be probed by the call of findElement(38) = k;modN and the secondary Note: The first row contains the indices and the second row contains the elements. 1 2 4 5 6. 7 8 10 11 12 27 14 available 6. 35 25 51