strangerdolan4123 strangerdolan4123 13-05-2023 English contestada Please only use graph theory to proveLet G be a connected graph with at least one cycle. Prove the following statement:We can remove some edges from G such that the resulting subgraph is bipartite and connected.