Let G be an undirected graph with n vertices and m edges.

Argue that

(a) If G is connected, then m n 1.

(b) If G is a tree, then m = n 1.