Please solve asap

Part (b): Insert the following sequence of elements into an AVL tree, starting with an empty tree: 10, 20, 15, 25, 30, 16, 18, 19. Also delete 30 in the AVL tree that you got. Part (c): Demonstrate what happens when we insert the keys 15, 20, 10, 25, 45 into a hash table with collisions. Let the table have 5 slots. Choose wisely to resolve collision and also support your choice with reasons