Problem $2$

A developer is planning a development that includes subdivisions of houses, cluster houses, townhouses, apartment complexes, shopping areas, a daycare center and playground, a community center, and a school, among other facilities. The developer wants to connect the facilities and areas in the development with the minimum number of streets possible. The following network shows the possible street routes and distances $($in thousands of feet$)$ between $10$ areas in the development that must be connected:

Determine a minimal spanning tree network of streets to connect the $10$ areas, and indicate the total streets $($in thousands of feet$)$ needed.

NOTE: To reduce the complexity, we will assume that items can flow only from nodes with lower numbers to nodes with higher numbers.