Design a hashing scheme for storing and retrieving students records $($admissions credentials, transcripts, degreeworks, bursar bills and payments, etc$).$ Assume $12,000$ students and use an address space of $15,000.$

Design a hash function and run an empirical experiment to evaluate the preponderance of collisions.