$(10$ p$.)$ Fill in the $17-$item hash table resulting from hashing the keys $6,12,28,34,36,29,16,33,40,24,20,9$ and $35$ and using the hash function $h(k)=k$ mod $17,$ and assuming that collisions are handled by

$($a$)$ linear probing

$\backslash$table$[[,,,,,,,,,,,,,,,,],[[0],[1],[2],[3],4,[5],[6],[7],[8],[9],[10],[11],[12],[13],[14],[15],[16]],[($b$),$separa,cha,,,,,,,,,,,,,,$],[[0],[1],[2],[3],[4],[5],[6],[7],[8],[9],[10],[11],[12],[13],[14],[15],[16]]]$

$(8$ p$.)$ Draw a graph of a final heap, after the following elements are inserted, in a given order, into an initially empty heap: $19,11,14,18,22,2,15,12,9$

$(8$ p$.)$ Draw all different heaps that can be made from five nodes that contain the following values: A$,$ B$,$ C$,$ D$,$ E$.$