=9-42 The following table represents a network with the arcs identified by their starting and ending nodes.

Draw the network and use the minimal-spanning tree to find the minimum distance required to connect these nodes.

Arc Distance 1–2 12 1–3 8 2–3 7 2–4 10 3–4 9 3–5 8 4–5 8 4–6 11 5–6 9