Minimal Spanning Tree Technique Creates a path between all points in a network while minimizing total distance. Five steps in the minimal spanning tree technique: Select any node (point) in the network. Connect this node to the node closest in distance. Starting from the nodes that are already connected, locate and connect the nearest node that is not connected.Do NOT connect nodes that are already connected.This creates a triangle. Repeat the third step until all nodes are connected. If there is a tie in the third step and two or more nodes that are not connected are equally near, select one arbitrarily and continue.A tie suggests there might be more than one optimal solution.As you can see, there are 10 blank squares that denote distances between each of the eight nodes. Use each of the following numbers to create your own model, then solve it using the minimal spanning tree technique: 2 5 6 11 3 3 3 7 7 7 4 6 9