Load the records of Exercise 17.31 into expandable hash files based on linear hashing. Start with a single disk block, using the hash function h ø = K mod 2º, and show how the file grows and how the hash functions change as the records are inserted. Assume that blocks are split whenever an overflow occurs, and show the value of n at each stage