Using the Division Remainder Method, give a concrete example of a hash function for a storage array with 10 storage locations addressed 0 through 9. Call your hash function h, define your function mathematically as h(x) = x mod 10, then use it to show how records with key fields of 53, 38, 42, 22, 32, and 76 (in that order) would be placed into storage using the diagram below. Don't worry about the Packing Factor or using a prime divisor. Use Linear Probing to handle any collisions:
Address | Contents
0
1
2
3
4
5
6
7
8
9