Statement I : If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge

Statement II : A graph G has a cycle if DFS finds at least 1 Backedge

Which of the following option is correct ?

a) Statement 1 is true and Statement 2 is true

b) Statement 1 is true and Statement 2 is false

c) Statement 1 is false and Statement 2 is true

d) Statement 1 is false and Statement 2 is false

Give me some explanation about backedge