Question 2 10 pts Select all the statements below which are TRUE: O The directed graph G and its transpose GT have the same strongly connected components SCCs. Prim's algorithm implementation uses a max-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 32, u f 37, v d 36, and v.f 9. If the graph G (VE) is sparse, then the preferred representation of the graph G is using adjacency-list representation A Minimum Spanning Tree is an acyclic subset of edges TCG.E, where all the edges in Tare connected and the weight of the tree is minimized. O Finding if two vertices are connected is done more efficiently using adjacency- matrix representation than using adjacency-list representation