Question 3. (6 points 1+1+2+1+1) We use a hash table that used the following hash function to store integers: h(X)EX mod 7. Assume at each position we use an AVL tree for colision resolution 0 1 2 3 4 5 6 @be 176 Insert the following keys into the given data structure above showing the affected AVL tree after these operations: a) put(57), put(64), put(85), put(148), put(281), put(99), put (162) and show the AVL tree b) put (155) and show the AVL tree c) remove(8) and show the AVL tree after each restructure operation. d) put(26), put(47), put(5), put (33) and show the AVL tree e) remove(40) and show the AVL tree