design/algorithm analysis:

Question 2 10 pts Select all the TRUE statements: 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. Any graph G can be represented using a binary search tree 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 = 4uf = 11, v.d -6, and vfs 7 A Minimum Spanning Tree (MST) is an acyclic subset of edges T G.E which connects all the vertices in G.V and whose total weight wT) is minimized. Let G(V,E) be a directed graph with V= [a,b,c,d,e,f] and E=lla,b),(ac),dc),(de). (e,f),(f,a). Then d,c,a,b,e,f is a topological sort of the vertices in V Let GVE) be a directed graph such that a,b,c E GV and (a,b), (b,c), (a,c) G.E Then a,b,c must belong to the same strongly connected component