question_answer

In a connected network of 'n 'arcs (roads) joining 'm' verticals (towns), a selection of roads is taken up for resurfacing based on a minimum spanning tree of the network as being the least cost solution. This spanning tree will contain:

A) m arcs              

B) (m + 1) arcs

C) \[(m\,-1)\] arcs               

D) \[(m+n-1)\] arcs