38. Trees and graphs are fundamental data structures. Which of the followingstatements are true?
(A) A weighted graph may bave multiple minimum spanning trees of the samecost.
(B) For two nodes in a graph, there may exist multiple shortest paths of the samelength linking the two nodes.
(C) For two nodes in a tree, there may exist multiple shortest paths of the samelength linking the two nodes.
(D) For a graph with n nodes and m edges, its minimum spanning tree has at least(n-1) edges.
(E) For a tree with n nodes and m edges, ntm＜2n must hold.