i need answer soonly. make sure the answer 100% correct

True-or-False 6 A. Multiple-Choice - 1 9 fn Code-Completion 1 (1 point(s)) 1-1 In a directed graph, the sum of the in-degrees and out-degrees of all the vertices is twice the total number of edges. Author DS Organization XIX OT OF 1-2 In a graph G, if we have to do BFS twice to visit every one of its vertices, then there must be a cycle in G. (2 point(s) ) Author DS Organization It OT OF 1-3 Kruskal's algorithm is to grow the minimum spanning tree by adding one edge, and thus an associated vertex, to (1 point(s) ) the tree in each stage. Author Organization It OT OF (2 point(s)) 1-4 The minimum spanning tree of a connected weighted graph with vertex set V={A, B, C, D, E } and weight set W={ 1, 3, 2, 5, 2, 7, 9, 8,4} must be unique. Author Organization I OT OF 1-5 For a graph, if each vertex has an even degree, we can find an Euler circuit that visits every vertex exactly once. (2 point(s)) Author Organization * OT OF (2 point(s)) 1-6 During finding all articulation points in a connected graph, if v1 is the parent of v2 in the depth-first tree, Num(v1) must be less than Num(v2). Author Organization It OT OF Activate Windows Go to Settings to activate Windo