Consider the instructor relation shown below

You need to build an extendable hash structure for this relation by using the above hash function results.

You need to insert the rows in the order of top to bottom. Each bucket can hold upto $3$ records. You need

to show a new extendable hash structure each time the size of the bucket address table is doubled. You

need to provide bucket address table, all buckets, all pointers, and hash prefix for bucket address table and

each bucket in your drawing. You need to use the hashing values in h$($Dept$\_$name$)$ starting from the most

significant bit $($the left$-$most bit$).$