help with this c++ question I am having a hard time understanding

7 points) Consider inserting the keys 31, 53, 1,4, 47, 39, 67,82 into an empty hash table of length on = 11. Assume collisions are handled using a technique called double hashing which uses the function h(k) = (ha(k) + jh2(k)) mod m, where h (k) = k mod m and ha(k) = 5 - (k mod 5), for j = 0,1,2,...,m -- 1. Indicate the sum of the values corresponding to all statements that are True. If none are True, the answer should be 0. Note that you must insert all values into the table and deal with collisions before answering the question. (1) 53 will be stored at index 0 (2) 47 will be stored at index 4 (4) 1 will be stored at index 1 (8) 39 will be stored at index 1 16