another example question uses 0, 7, 2, 17, 31, 3, 6, 8, 23, 5, 10, and 20 assuming collisions are handled by double hashing with d(k) = 7- k mod 7 and the hash table is not resized until the end

HOW DOES THIS WORK????

I HAVE NO CLUE WHAT ITS EVEN ASKING

Illustrate the 11-entry hash table that results from using the hash function, h(i) = i mod 11, to hash the keys 0, 11, 2, 22, 33, 3, 6, 8, 7, 9, 18, and 10, assuming collisions are handled by linear probing (10 points). Fill in the table below as well as explanations for probing, if there's any