On the left is an array of numbers that are to be inserted $($in order, from top to bottom$)$ into the hash

table on the right. The hash table uses open hashing to deal with collisions.

Move each record on the left to the appropriate bin on the right when using the simple mod hash

function.

Please explain on how to do this question and also please explain how the remainders of the numbers goes into those bins. For Example: $436$ mod $10$ remainder of $6$ placed in bin $6$