Select all the TRUE statements: If the graph G (VE) is dense, then the preferred representation of the graph G is using adjacency-list representation Prim's algorithm implementation uses a min-heap Q based on a key attribute 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-6,v.d-7, and v.f-10. O Any component graph is acyclic. O The MST computed by Prim's algorithm is an acyclic subset of edges T E, where all the edges in T are connected and the weight of the tree is minimized Finding if two vertices are connected is done more efficiently using adjacency-matrix graph representation than using adjacency-list graph representation O Let G(V.E) be a graph that consists of a cycle with 100 vertices and 100 edges. Then the adjacency-list representation of G is preferred