Let T = (V, E) be a tree and let d(v) be the degree of a vertex.
Consider following statements:
(i) P v∈V (2 − d(v)) = 2
(ii) If T has a vertex of degree m ≥ 2, then it has at least m vertices of degree 1.
(iii) P v∈V (k − d(v)) = k, for k ≥ 2 | k ∈ Z + Which of the above statements is/are ture:
(A) (i) only
(B) (i), (ii) only
(C) (ii) and (iii) only
(D) (i), (ii) and (iii) only