Question $2$: HashingA hash table with a size of $11$ is given below. The hash function is k $=$ k mod $11.$ Write down the entriesafter the keys $\{5,15,19,15,20,33,11,17,11\}$ have been inserted. Use chaining to resolve collisions.

index

$0$

$1$

$2$

$3$

$4$

$5$

$6$

$7$

$8$

$9$

$10$

If the same keys are put into a HashSet, what will be the resultant HashSet?