Answer:
8
Explanation:
we know that
Euler's Sum of Degrees Theorem states that: The sum of the degrees of all the vertices equals twice the number of edges.
The number of edges in any tree with N vertices will be N - 1
so
The sum of degrees is given by
![2(N-1)](https://img.qammunity.org/2021/formulas/mathematics/high-school/if6vb39mme9sw4rjesl228iz7tl3gs7ps9.png)
we have
![N=5](https://img.qammunity.org/2021/formulas/mathematics/high-school/xfsr7qlhmdrlidgs62c8y48n5be0jrb423.png)
substitute
![2(5-1)=8](https://img.qammunity.org/2021/formulas/mathematics/high-school/e40h49jzw772pmw9n5tv9wq8u9wnce0cwv.png)