For a network with n nodes, a spanning tree is a

Group of answer choices

set of n arcs that connects all nodes.

set of $($n$-1)$ arcs that connects all nodes and contains no loops.

random subset of arcs covering all nodes.

set of dummy arcs.