Need Help. Thanks

Question 2 10 pts Select all the TRUE statements: Let G(VE) be a directed graph with V-lab,c,d,e,f] and E-(ablja,c),(d,c),(d,e),(e,f),(f,a)). Then d,c,a,b,e,f is a topological sort of the vertices in V. Any graph G can be represented using a binary search tree. The height of a binary search tree with 8 nodes is greater than or equal to 3 and less than or equal to 7 Let G be an undirected graph. DFS(G) can yield cross edges if the graph G is partitioned. A Minimum Spanning Tree (MST) is an acyclic subset of edges T C GE which connects all the vertices in G.V and whose total weight w(T) is minimized. Let u, v be two vertices in the directed graph G. After running depth-first search (DFS) algorithm on G, it is possible to get the following discovery and finishing times: u.d-4, u.f 11, v.d = 6, and v.fs 7. Let GVE) be a directed graph such that a,b,CE G.V and (a,b), (b,c), (a,c) e GE. Then a,b,c must belong to the same strongly connected component