A$)(15$ points$)$ Draw tho binory min heap that resules from lnsertinis $11,9,12,14,3,15,7,8,1$ in

that order into an initlally empty binary heap. You do not need to show the arrav representation

of the heap You are only requlred to show the final tree, eltheugh if you draw interinediate

trees, plesise circle voiar final sesuil for any credil.

$(15$ pointe$)$ Draw the binary heap that results from deins $2$ deleteminimum on the heap you

Created in Dant A$.$ You are only requlred to show the final Iree, although if you draw intermediate

Irees, please circle your linal result for any credit.

$(25$ noints$)$ Draw the contents of the hast table in the boxes below glven the following

conditions:

a$.$ The slze of hash table is $12$

b$.$ Double hashing is used to resolve collision:

c$.$ Second hash function is $|{|}_7(k)=7.($k moud $7)$

What values will be in the hash table after the following sequence if insertions? Draw the values

In the boxes befow and show vour work for partlal credis.

$33,10,9,13,12,45,26,17$

$(20$ peints$)$ insert values $1,2,5,4,6,3,7,8,9$ in that order into a B tree with Max Degreen$3.$

please circle your final result.

$4(25$ points$)$ Determine the Huffman code for the string STLRLOTLLE METER by building a lluffman

coding tree, Your solution must show both the Huffman tree and the corresponding Huffman

code $($fill the table below$).$ Label the nodes and edges of your tree, You do not have to enode

the string.