A recurrence relation arises from a divide-and-conquer algorithm: $a_n = \sqrt{2} \cdot a_{n/2} + 1$ (taking the square root of the number of subproblems). To solve, substitute $b_n = \log_2 a_n$ to linearize. What is the growth rate $\Theta(a_n)$?