C++ Hash Function

Could anyone please explain step by step how to do this problem please? Thank you

Suppose there are seven students with IDs 571, 933, 421, 904, 155, 990, and 205. Suppose hash table, HT, is of the size 10, indexed 0,1,2, , 9. Show how these students IDs, in the order given, are inserted in HT using the hashing function h(k) = k % 10. Use l to resolve collision, where the second hash function is given by g(k) = k % 9. (Hint: probing sequence is (h(X) + i * g (X)) mod HTSize)

HT
0
1
2
3
4
5
6
7
8
9