Q47

Let $G$ be an undirected graph, which is a path on $8$ vertices. The number of matchings in $G$ is $\_\_\_\_$. (answer in integer)