#### Answer

Kruskal's, weight, circuits

#### Work Step by Step

A procedure that yields the tree in Exercise 3 is called Kruskal's Algorithm. The idea of the algorithm is to always pick the edge with the smallest available weight, but avoid creating any circuits.