Select true statements (negative points for incorrect selections) 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 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 Consider the array with elements: 18, 10, 20, 5, 8, 9, 3. Applying the heapify() to convert the list to a minimum heap rearranges the elements to: 359 10 8 18 20 3 10 9 5 8 18 20 18 10 3 5 8 9 20 3 10 18 5 8 9 20 Consider DFS in the graph below starting form node E. The next node visited in the partial traversal EHGCF will be node A A B E F H True False