A recursive function processes a sequence of length $n$ by making recursive calls on two independent subproblems. Let $W(n)$ be the total work (cost of all recursive calls combined, including the root). If each level of recursion does work proportional to $n$, and the recursion tree has depth $\Theta(\log n)$, which statement about $W(n)$ is correct?