Instead of using an array to store pointers to linked lists, you would like to explore using an AVL tree that you have pre-populated with a node for each address in the hash table. Therefore, the...

Instead of using an array to store pointers to linked lists, you would like to explore using an AVL tree that you have pre-populated with a node for each address in the hash table. Therefore, the number of nodes nin the AVL tree corresponds to the size of the hash table.

How would using an AVL tree to store the pointers to the linked lists affect the running time of insertions, deletions, and findsinthe hash table? Your answer must include a justification that describes the running timein terms of the hash table size.You must usebig-Ohnotation.