The table below shows several items and their hashcodes, as derived from some arbitrary hashing function. Assume you have a hashtable with an initial array size of 13 (0-based) and a load factor of 0.75. Assume the array is always doubled when it needs to be resized (i.e., the table size sequence is: 13, 26, 52, 104, ...). Assume the items are added in the order in which they are listed, and assume the hashtable uses quadratic probing to resolve collisions.

Match each item in the table with the numbered array index in which it will reside once all the items have been added Hashcode tem Snakeskin Fruit Atemoya Akebia Quinata Rambutan Screw Pine Buddha' s Hand Jackfruit Kivano 2236 1776 8231 529 661 3388 1492 2012 A. 0 Snakeskin Fruit Atemova Akebia Quinata C. 2 D. 3 E. 4 F. 5 G. 6 H. 7 Rambutan Screw Pine Buddha's Hand Jackfruit Kiwano J. 9 K. 10 M. 12