What is the time taken for a range query for a perfectly balanced tree?

(a) O(N)

(b) O(log N)

(c) O(√N+M)

(d) O(√N)

I want to ask this question from Trees topic in division Trees of Data Structures & Algorithms I

I got this question in an interview.