Solution
= Solution
{c}
\b[True.] Each <connected component> of a <forest> is a <tree (graph theory)>. If the component sizes are $n_1,\ldots,n_k$, their edge counts are $n_1-1,\ldots,n_k-1$, including isolated vertices as size-one components. Summing gives $m=n-k$, hence
$$
\boxed{k=n-m.}
$$