14) Consider a Dictionary implemented with an AVL tree. What is the worst-case time complexity of the following algorithm written in pseudo-code? Note: You can assume that dict is a previously created instance of a pictionary and that key and value were also declared before.: * For i = 0 to 5 dict.put(key, value); dict.remove(key); OA) O(log n) OB) O(n) OC) 0(5) OD) O(nlog n) OE) None of the above