Question 4 2 pts Kruskal's algorithm finds a safe edge to add to a growing forest by finding, of all the edges, that connect any two trees in the forest, an edge of constant weight a safe edge to add to a growing forest by finding, of all the edges, that connect any two trees in the forest, an edge of least weight O a safe edge to add to a growing forest by finding of all the edges, that connect any two trees in the forest, an edge of no weight a safe edge to add to a growing forest by finding, of all the edges, that connect any two trees in the forest, an edge of most weight