What can be the maximum depth of the trie with n strings and m as the maximum sting the length?

(a) log2n

(b) log2m

(c) n

(d) m

My doubt is from Trie in division Trie of Data Structures & Algorithms I

This question was addressed to me at a job interview.