Select all the TRUE statements: Finding if two vertices are connected is done more efficiently using adjacency-matrix graph representation than using adjacency-list graph representation. Let u, v be two vertices in the directed graph G. After running the Depth-First Search algorithm on G, it is possible to get the following discovery and finishing times: u.d-2, u.f-7, v.d- 6, and v.f 9. O The directed graph G and its transpose GT have the same strongly connected components. If the graph G-(V,E) is sparse, then the preferred representation of the graph G is using adjacency-list representation. O Prim's algorithm implementation uses a min-priority queue Q based on a key attribute. O A Minimum Spanning Tree is an acyclic subset of edges T E, where all the edges in T are connected and the weight of the tree is minimized