C$.$ The network pictured below represents the layout of computers in a wired office layout. All possible wiring paths are shown. $($Some obstacles exist between computers that eliminate some possible paths.$)$ Each node is the location of a PC and the branches represent cables connecting the computers. The number on a branch indicates the length of the path in meters. $($NOTE: The figure is not drawn to scale.$)$

Scenario I: Suppose that Node $1$ is the entry point for a cable system that will tie all the computers together into one network.

$24.$ For Scenario I described the sentence above, in new lines entered below this part, state the specific type of network flow problem this is$.$

The network layout described represents a Minimum Spanning Tree $($MST$)$ problem, where the objective is to find the minimum total length of cables required to connect all computers in the office.

$25.$ Start from Node $1.$ Determine, by manual calculation, the minimum total amount of cable that would be needed to link each and every individual computer into a single network.

In lines inserted below, you MUST present HERE your full and complete step$-$by$-$step manual solution to Scenario I. Scanned images of hand$-$drawn figures are acceptable.

$26.$ In new lines entered below this part, present a drawing HERE of the final network representation for Scenario I showing only the routes that are used.