14 H 15 A 20 (6-5) Given a weighted undirected graph G(V, E) below. Construct the minimum spanning tree (MST). Which of the following statement(s) is (are) true? (A) If the MST is constructed by Kruskals algorithm, edge (H, F) is the 6th edge added to the MST. (B) If the MST is constructed by Kruskals algorithm, the MST is a binary tree. (C) If the MST is constructed by Prim's algorithm and starting from vertex D, edge (B, C) is the 6th edge added to the MST. (D) If the MST is constructed by Prim's algorithm and starting from vertex D, vertex A is vertex H's descendant. (E) If the MST is constructed by Sollin's algorithm, assuming vertex G as the root, the MST has height of 5. 11 B 16 18 10 D