Draw the final AVL tree only. 2. (8p) Draw a graph of a final heap, after the following elements are inserted, in a given order, into an initially empty heap: 3,11,15,7,19,1,20,10,8 3. (8p) Fill in the 17-item hash table resulting from hashing the keys 17,11,95,15,34,25,16,33,90,48,77,20,35 and 80 , using the hash function h(k)=k mod 17 , and assuming that collisions are handled by (a) linear probing