Computer Science Homework Help

I have a question about Hash table. I need help getting to the answer. let me know if the fifle can’t be opened.

Insert the following integers into a Hash table of size 23 (0 indexed). Use quadratic probing. The hash function should be one that uses the sum of the digits. For each insertion list the index the element is placed at and the number of collisions