Let G be an undirected graph on n vertices and m edges. Describe an algorithm running in O(n+m) time that can determine whether G contains exactly two cycles that have no edges in common.