You will be given a hash table $($threshold$=1\mathrm{.}85)$ and a pair of insertions to perform on it$.$ For each insertion, submit a representation of the resulting hash table.

Note: We have given you your own hash table renderer to assist you in solving this question. The table should be extended when r$/$N $>=$ threshold.

Operation:

Initial hash table representation:

$\{\text{'}00\text{'}$: $[\text{'}010100\text{'},\text{'}011000\text{'},\text{'}000100\text{'}],\text{'}01\text{'}$: $[\text{'}011011\text{'},\text{'}011001\text{'}],\text{'}10\text{'}$: $[]\}$

insert $010111$

insert $010010$