int getIndex(String k) { return k.length() % 10; }

Using the above hash function, which of the following pairs of subsequent set calls will result in a collision, assuming that the current number of buckets is large enough to store all the elements (i.e. the array is large enough to store all the elements)? (the hash table uses String keys and double values)

A. set("shampoo", 2); set("conditioner", 3);

B. set("boba", 4.5); set("crispy chicken", 8.5);

C. set("sandwich", 4); set("salad", 5);

D. set("coca cola", 2); set("coke zero", 2);

E. set("water bottle", 1.5); set("flamin' hot cheetohs", 2);