Suppose you have a connected graph G represented by an adjacency matrix and you want to find out if G is a tree. Which of the following strategy would work? O Perform DFS. If there are n-1 discovery...

Extracted text: Suppose you have a connected graph G represented by an adjacency matrix and you want to find out if G is a tree. Which of the following strategy would work? O Perform DFS. If there are n-1 discovery edges, it is a tree. O Perform BFS. If all the nodes are visited, it is a tree. Perform DFS. If I do not encounter any back edge, it is a tree. O Perform BFS. If I do not have more than n discovery edges, it is a tree. None of the above