Problem 3. (20 points) Answer the following problems using the hash function in Figure 2. For each problem, start with the extendable hash structure in Figure ;3 dept name h(dept name) Biology Comp. Sci. Elec. Eng. Finance History Music Physics 1111 0001 0010 0100 1001 0011 0110 1101 01 1010 0011 1010 0000 1100 0110 1001 1111 0011 0101 1010 0110 1100 1001 1110 1011 1001 1000 0011 1111 1001 1100 0000 0001 Figure 2: Hash Function for dept.name hash prefix 15151 Mozart Music40000 12121 Wu Finance 90000 bucket address table Einstein 95000 0101 Srinivasan Sci. 65000 Figure 3: Extendable Hash Example (a) (10 points) Show the extendable hash structure that would result from inserting (11111, Myers, Finance, 90000) into the structure in Figure 3 (b) (10 points) Show the extendable hash structure that would result from inserting (10000, Bach, Music, 50000) and (11000, Beethoven, Music, 60000) into the structure in Figure 3