For an AVL tree if an element is added to the child place several times wait until half balanced and it will be in the root position what is the worst case complexity to make rebalance?

A$)$ N$/2$logN$/2$

B$)$ Nlogn

C$)$ n$^2$

D$)$ n$^3$

E$)$ loglogn

F$)$ logN