Question 5 (1 point) Select all true statements ( negative points for incorrect selections) In the Bellman-Ford algorithm the outer loop must must run (V-1) times, where V is the number of nodes in the graph. The Bellman-Ford algorithm produces correct result if applied to a graph with negative cycle. The Bellman-ford algorithm finds the shortest path form the start node to other nodes in the graph The Bellman-for algorithm run time is O(VE), where V is the number of nodes and E is the number of edges. Question 10 (1 point) Select true statements (negative points for incorrect selections) A minimum spanning tree can only be built for an undirected graph Kruskal's algorithm ends when either the vertex-sets length is less than or equal one OR no more edges are left in the edge-list Kruskal's algorithm works on undirected graphs Kruskal's algorithm finds a subset of the graph's edges that connect all vertices in the graph together with the minimum sum of edge weights Give the balance factor for the nodes in the tree: B E H BF(A) = 2, BF(B) = 0, BF(C) = -1, BF(E) = 1, BF(H) = 0 = BF(A) =-2, BF(B) = 0, BF(C) = 2, BF(E) = -1, BF(H) = 0 = BF(A) =-2, BF(B) = 0, BF(C) = -1, BF(E) = -2, BF(H) = 0 = = = BF(A) =-3, BF(B) = 0, BF(C) = -2, BF(E) = -1, BF(H) = 0 = = =