True or False? (Proof or counterexample) If a directed graphG= (V, E)is cyclic but can be made acyclic by removing one edge, then a depth-first search in G will encounter exactly one back edge.