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

• A. Θ(n4)
• B. Θ(n2)
• C. Θ(n2log n)
• D. Θ(n3)