The first step of the minimal spanning tree solution method is to:

Incorrect answer:

select the node closest to the starting node to join the spanning tree.

select any starting node.

$,$ Not Selected

select the closest node not presently in the spanning tree.

$,$ Not Selected

arbitrarily select any path in the network from origin to destination.