Which two of the following are equivalent for an undirected graph G? (i) G is a tree (ii) There is at least one path between any two distinct vertices of G (iii) G contains no cycles and has (n-1) edges (iv)G has n edges

Which two of the following are equivalent for an undirected

1.	Which two of the following are equivalent for an undirected graph  G? (i) G is a tree (ii) There is at least one path between any two distinct vertices of G (iii) G contains no cycles and has (n-1) edges (iv)G has n edges
A.	(i) and (ii)
B.	(i) and (iii)
C.	(i) and (iv)
D.	(ii) and (iii)
Answer» C. (i) and (iv)