Let T be a tree with n vertices, n ≥ 2. For a positive integer i, let pi be the number of vertices of T
of degree i.
(a) Prove that
p1 − p3 − 2p4 − · · · − (n − 3)pn−1 = 2.