Given two forests A and B with V(A)=V(B), that is the graphs are over same vertex set. Suppose A has strictly more edges than B. Prove that there exists an edge of A which if included in the edge set of B, then B will still remain a forest. Graphs are undirected combinatoricsgraph theory