(a) Let T = (V, E) be a tree. If v ∈ V, prove that v is an articulation point of T if and only if deg(v) > 1.
(b) Let G = (V, E) be a loop-free connected undirected graph with |E| ≥ 1. Prove that G has at least two vertices that are not articulation points.