$4\mathrm{.}1\mathrm{.}2$ Show that the following three statements are equivalent.

a$)G$ is connected and has $n-1$ edges.

b$)G$ is a forest and has $n-1$ edges.

c$)G$ is a tree.