Given a preorder traversal sequence of a binary search tree T as 41, 20, 8, 32, 25, 63, 55, 49, 44, 68, 65. Which of the following statement(s) is (are) true? (5 points) (A) The number of leaf nodes in the tree T is 4. (B) If the tree T is traversed by postorder traversal, the first node visited is 8. (C) The height of T is 4. (D) The tree T is not an AVL tree. (E) The tree T cannot be uniquely determined. Given an undirected graph G(V, E) where the number of vertexes is n and the number of edges is m. Which of the following statement(s) is (are) true about the graph G? (5 points) (A) If G is represented by adjacency matrix, the space complexity is O(n?). (B) IF G is represented by adjacency list, the space complexity is O(m). (C) If G is represented by adjacency list, the time complexity to determine whether G is connected is (m). (D) If G is connected, then n2m +1. (E) If G is represented by adjacency list, the time complexity for determining whether every vertex in G has at least two paths to any other vertex in G is O(n)