A recursive algorithm divides an input of size $n$ into two subproblems of size $n/2$ each, with base case when $n=1$. What is the maximum recursion depth (number of active stack frames at the deepest point, including the deepest call)?