What is the worst case time complexity of the insertion in the hash tree?

• A. O(logk(n))
• B. O(n2)
• C. O(nlogk(n))
• D. O(kn)