A recursive function has call tree depth (maximum recursion depth) of $\log_2 n$. If each function call performs $O(n)$ work, what is the total time complexity?