Which of the following statements is/are true?
A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree.
B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same tree.
C. In a strongly connected directed graph G, depth first search started from any node always form a tree, not forest with more than one tree.
D. In a directed graph G, there is path from node u to v (u v). If u.d < v.d in a depth-first search forest of G then v is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).