2. (10%) Answer "True" or "False" for the following statements. (a) Let d, be the degree of vertex i in an undirected graph G with V = n and 2 - e, then e= . (b) No edge can be in two or more biconnected components of a graph. (c) Given a graph G = (V, E) and a start vertex voeV in graph search, a vertex ve V where i = 0 might be reachable in BFS but unreachable in DFS. (d) The depth first search operation is similar to a preorder tree traversal and hence requires a dynamically linked queue (e) Given an undirected weighted graph G = (V, E), the minimum cost spanning tree of G is always unique. (f) If an AOV represents a feasible project, the precedence relations must be transitive and irreflexive and its topological order might not be unique. (g) Heap sort is an unstable sorting method. (h) Both insertion and deletion on a max heap with n nodes require O(nlogn) time complexity. (i) Given an undirected graph G = (V, E), the spanning trees of G resulting from a depth first and breadth first search might be distinct. () In external sorting, the number of passes over internally sorted runs can be reduced by using a higher-order merge, i.e., k-way merge for k> 2