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

select any starting node

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

select the closest node not presently in the spanning tree

arbitrarily select any path in the network from origin to destination

select the node with the shortest direct route from the origin

None of the above