Assume that we use the Linear hashing technique in some situation and we use the hash functions h$0,$ h$1,$ h$2,...$ as $($K mod $2),($K mod $4),($K mod $8)$ and so on$.$ Assume that a bucket $($one block$)$ can accommodate $2$ records. Now insert the records with the following keys in the same order and show the dynamic structure of the hashing scheme $($with a simple free$-$hand diagram$)$ after each insertion.

Keys to be inserted are: $12,31,9,26,6,30,15,3,17,42.$ Note that split occurs when the fileload factor $($f$)$ exceeds $0\mathrm{.}7.$ Do also consider overflow buckets while computing f$.$