For a graph $G=(V,E)$ ($V$ set of vertices and $E$ set of edges ), $mathcal{I}$ is defined as all of the subsets $E´subseteq E$ where the components of $(V,E´)$ that are connected are simple paths. I want to show that $(E,mathcal{I})$ does not satisfy the exchange property of a matroid.

I have tried to find an example by drawing two graphs, that is, two graphs with all of the vertices $V$ and where each graph has a set of edges that together creates a forest. And I tried to make one graph have more edges than the other and find an example where we can NOT add an edge that is in the graph with more edges (but not in the graph with less edges) to the graph with less edges and still have a forest.

But I can not find such an example and I am stuck. Maybe there is a simpler way to prove it?