Let $=(,)$G$=($V$,$E$)$ be a connected graph and $$ in $(2)$e in $(2$V $)$E be an edge. Let $$C be a cycle of $+$G$+$e that contains $$e and $$f an edge of $$C$.$ Let $$f be an edge of $$C other than $$e and let $$:$=+$G $$ :$=$G$+$e$$f$.$ Which of the following statements is true for all $,,$G$,$e$,$f as described?$1$ pointIf $$G is acyclic then $$G $$ is acyclic.If $$G contains a cycle then $$G $$ contains a cycle.$$G $$ is connected.$$G $$ has at least as many cycles as $$G$.$G $$ has at most as many cycles as $$G$.$