Insert the records with the keys $6,3,1,11$ into a hash table using linear hashing. Use h$($key$)=$key as the hash function. Assume that initially, the buckets are empty, there are $2$ data buckets $($N$=2),$ each data page can hold at most $2$ records, Next$=0,$ and Level$=0.$ Show each step of the insertion.

The initial hash table is given as follows:

N$=2,$ level$=0,$ Next$=0$