Let $T_n$ be the number of ternary trees (each node has at most 3 children, distinguished by position as left, middle, or right) with $n$ nodes. Which of the following is the recursive relation for $T_n$ for $n \geq 1$?