You are given a graph G= (V, E) and a set of edges X∩E, in which there are no cycles consisting only of edges in X. Prove or disprove: you can always construct a spanning tree of G that includes every edge in X. If you try to prove this, you should provide an algorithm that finds the spanning tree. If you try to disprove it, you should provide a counter-example.
*The symbol between X and E is incorrect. It should be flipped and have a _ under it, but I couldn't produce this symbol.