5. Let $A B C D E F$ be a regular hexagon. A frog starts at vertex $A$ and can randomly jump to one of the two adjacent vertices each time. If it reaches point $D$ within 5 jumps, it stops jumping; if it does not reach point $D$ within 5 jumps, it stops after 5 jumps. How many different possible jumping sequences are there from the start to the stop?

将上面的文本翻译成英文，请保留源文本的换行和格式，直接输出翻译结果。
5. 26.

As shown in the figure, it is obvious that the frog cannot reach point $D$ by jumping 1 time, 2 times, or 4 times. Therefore, the frog's jumping methods are only of the following two scenarios:
(1) The frog reaches point $D$ by jumping 3 times, with 2 ways to do so;
(2) The frog stops after jumping 5 times in total. In this case, the number of ways to jump the first 3 times (without reaching point $D$) is $2^{3}-2$ ways, and the number of ways to jump the last two times is $2^{2}$ ways. Therefore, the number of ways the frog can jump 5 times in total is $\left(2^{3}-2\right) \cdot 2^{2}=24$ ways.
From (1) and (2), we know that the frog has a total of $2+24=26$ different ways to jump.