If the DFS tree does not have any back edges, then there are no cycles in the graph. Group of answer choices True False

A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. State true or false.a)Trueb)False

Which of the following statements is true regarding DFS and cycles in directed graphs?2 pointsDFS can detect cycles only in undirected graphs, not in directed graphsDFS can detect cycles in directed graphs by keeping track of visited verticesDFS cannot detect cycles in directed graphs; it requires a separate algorithmDFS can only detect cycles in directed graphs if they are Hamiltonian cycles

What is the time complexity of detecting a cycle in an undirected graph using DFS?O(V)O(V+E)O(ElogV)O(V^2)

Any graph is a tree if and only if the graph is.... Question 32Select one: A directed graph Completely connected Contains no cycles

Edge which connects a vertex to an ancestor in the DFS tree is termed asa)Back edgesb)None of the mentionedc)Cross edgesd)Forward edges