java -- please explain in detail

5 i(b) [5 Marks] Complexity From among the following, identify the the most accurate statement about computational compexity. If uncertain, use the 'clear' button to clear your answer. O The worst-case time complexity of finding an element in a binary search tree is Olog N) O The worst-case time complexity of finding an element in a binary search tree is ON log N) O The time complexity of finding an element in a balanced binary search tree is ON O The time complexity of finding an element in a balanced binary search tree is Olog N