Let t be a depth first search tree in a undirected graph g. vertices u and v are leaves of this tree t. the degrees of both u and v in g are at least 2. which one of the following statements is true?
A) G contains a cycle
B) G is a tree
C) G is a complete graph
D) G is a bipartite graph