Answer: (ii) $V-1$

Explanation:

• A spanning tree of a connected graph with $V$ vertices is a tree that includes all $V$ vertices.
• Any tree with $V$ vertices has exactly $V-1$ edges (proof by induction; also $|E|=|V|-1$ characterizes trees among connected graphs).
• Edge weights (positive or otherwise) do not affect the count — any spanning tree, regardless of weight, has $V-1$ edges. Minimum spanning tree also has $V-1$ edges; weight affects which edges, not how many.
• Additional edges would create a cycle → not a tree.

Correct choice: (ii) $V-1$ (if graph disconnected, spanning forest has $V-c$ edges for $c$ components).