If G is a forest with n vertices and K connected components, then how many edges does G have?

\(\left\lfloor {n/K} \right\rfloor\)

If G is a forest with n vertices and K connected components, then how

1.	If G is a forest with n vertices and K connected components, then how many edges does G have?
A.	\(\left\lfloor {n/K} \right\rfloor\)
B.	n - K
C.	n - K + 1
D.	n - K - 1
Answer» C. n - K + 1