X$1229$: Hash Function Sum Digits

Write a function in Java called hashSumDigits$()$ that will take a non$-$negative value to be stored in a hash table and the size of the table and returns the index where the value will be stored.

This hash function sums all the digits in the value to be stored and then returns the modulo of that sum with the size of the table.

You should use a loop to sum of all the digits. Remember that mod$(\%)$ by $10$ yields the rightmost digit $($e$.$g$.,126\%10$ is $6),$ while division $()$ by $10$ removes the rightmost digit $($e$.$g$.,\frac{126}{10}$ is $12).$

Examples:

hashSumDigits $(126,5)4$

hashSumDigits $(49,5)3$

hashSumDigits $(731,5)1$