What is the worst case time complexity of inserting n$2$ elements into an AVL$-$tree with n elements initially $?$

a$.($n$.)$

b$.($n$^2)$

c$.($n$^2*$ log n$)$

d$.$O$($log n$)$