$($i$)$ List of keys $(k)=6,17,23,29,34,48,99,50$ are inserted into the hash table by using hash function $H=k$

mod table size and table size is $10.$ For resolving collisions linear probing used.

$[5$ Marks$]$

Number of collisions occurred when we insert new element $\text{'}103\text{'}$ is

Show all steps.

$($ii$)$ How many bits are needed to encode a string containing $15$ a$\text{'}$s$,3$ b$\text{'}$s$,7$ c$\text{'}$s and $10$ d $\text{'}$s using the Huffman

coding. Draw the tree.

$[5$ Marks$]$