Which of the following most accurately and precisely characterizes the complexity of lookup in a balanced BST (\( \Theta( \log{n} ) \) height).

• \( \Theta(1) \)
• \( \Omega( \log{n} ) \)
• \( \Theta( \log{n} ) \)
• \( \mathrm{O}( \log{n} ) \)
• \( \Omega(n) \)
• \( \Theta(n) \)
• \( \mathrm{O}(n) \)