A tourist starts by taking one of the $n$ available paths, denoted by $1,2, \cdots, n$. An hour into the journey, the path $i$ subdivides into further $1+i$ subpaths, only one of which leads to the destination. The tourist has no map and makes random choices of the path and the subpaths. What is the probability of reaching the destination if $n=3 ?$
- $\frac{10}{36}$
- $\frac{11}{36}$
- $\frac{12}{36}$
- $\frac{13}{36}$
- $\frac{14}{36}$