Determine which statement about the number of non$-$tree edges is correct when using DFS on this graph. Non$-$tree edges are those edges of the graph that are not part of the predecessor tree $($which is represented by the parent array$).$

Question $11$Select one:

It is always $2.$

All the edges in this graph are tree edges no matter where the DFS has started from.

It is always $0.$

It can vary depending on whether the search reaches a cycle.

It is always $1.$

It depends on what vertex the search starts from.