Select all the TRUE statements: The directed graph G and its transpose G have the same strongly connected components Finding if two vertices are connected is done more efficiently using adjacency-matrix graph representation than using adjacency-list graph representation. O Prim's algorithm implementation uses a min-priority queue Q based on a key attribute. O 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 If the graph G (V,E) is sparse, then the preferred representation of the graph G is using adjacency-list representation E, where all the edges in T are A Minimum Spanning Tree is an acyclic subset of edges T connected and the weight of the tree is minimized