solve 2

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